棕名 20分 dfs求调

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5, maxm = 2 * 1e5 + 5;
int n, m, cnt;
int vis[maxn];
vector<int> e[maxm];
void dfs(int u) {
	vis[u] = 1;
	for (int i = 0; i < int(e[u].size()); i++) {
		int v = e[u][i];
		if (!vis[v]) dfs(v);
	}
}
int main() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		e[x].push_back(y);
		e[y].push_back(x); 
	}
	for (int i = 1; i <= n; i++) {
		if (!vis[i]) {
			cnt++;
			dfs(i);
		}
	}
	cout << cnt << " " << n - cnt;
	return 0;
}