Submission #64418621

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define endl '\n'
#define x first
#define y second
typedef pair<int,int>pii;
const int N = 1e6 + 10;
string s;
int n,m;
int fa[N];
int a[N];
int cnt;
int find(int x){
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}
void solve(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++) fa[i] = i;
	for(int i = 1; i <= m; i++) {
		int u , v;
		cin >> u >> v;
		if(find(u) == find(v)) cnt++;
		else{
			fa[find(u)] = find(v);
		}
	}
	cout << cnt;
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//	int T;
//	cin>>T;
//	while(T--)	
	 solve();
	return 0;
}

Submission Info

Judge Result