11422022-03-15 12:44:00vandrasPletykacpp14Wrong answer 0/100141ms41960 KiB
#include <bits/stdc++.h>
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

tem T>
string _ARR_(T* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9 + 7, N = 200005;

int n, m, k, comp[N], sz[2], vis[N], ok=0;
vector<int> adj[N];

void dfs(int u){
	vis[u] = 1;
	++sz[comp[u]];
	for(int v : adj[u]){
		if(!vis[v]){
			comp[v] = !comp[u];
			dfs(v);
		}else if(vis[v] && comp[v] == comp[u]){
			ok = 1;
		}
	}
}

int main()
{
	FAST;
	cin >> n >> m >> k;
	vector<int> s(k);
	for(int &t : s) cin >> t;
	for(int i = 0; i < m; ++i){
		int u, v; cin >> u >> v;
		--u; --v;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	comp[0] = 1;
	dfs(0);

	vis[0] = vis[1] = 0;
	for(int u : s){
		vis[comp[u]] = 1;
	}

	ok |= (vis[0] && vis[1]);	

	if(ok){
		cout << n << '\n';
	}else{
		cout << max(sz[0], sz[1]) << '\n';
	}


	cout << 5 << '\n';
	return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/100
1Wrong answer0/07ms11220 KiB
2Wrong answer0/019ms14828 KiB
3Wrong answer0/26ms11512 KiB
4Wrong answer0/26ms11692 KiB
5Wrong answer0/27ms11756 KiB
6Wrong answer0/28ms12008 KiB
7Wrong answer0/48ms12256 KiB
8Wrong answer0/410ms12804 KiB
9Wrong answer0/49ms13104 KiB
10Wrong answer0/49ms12756 KiB
11Wrong answer0/419ms15612 KiB
12Wrong answer0/419ms15252 KiB
13Wrong answer0/428ms17560 KiB
14Wrong answer0/448ms18672 KiB
15Wrong answer0/639ms20252 KiB
16Wrong answer0/646ms22604 KiB
17Wrong answer0/657ms26016 KiB
18Wrong answer0/652ms25228 KiB
19Wrong answer0/668ms28788 KiB
20Wrong answer0/668ms31964 KiB
21Wrong answer0/686ms32320 KiB
22Wrong answer0/675ms34296 KiB
23Time limit exceeded0/6141ms39708 KiB
24Time limit exceeded0/6129ms41960 KiB