#include <iostream>
using namespace std;
const int N = 1e6 + 10;
int p[N], m, n, k;
int st[N], ans;
int find(int x) {
if(x != p[x]) p[x] = find(p[x]);
return p[x];
}
int main() {
cin >> m >> n >> k;
for(int i = 1; i <= n * m; i ++ ) p[i] = i;
for(int i = 1; i <= k; i ++ ) {
int a, b;
cin >> a >> b;
if(find(a) != find(b)) {
p[find(a)] = find(b);
}
}
for(int i = 1; i <= n * m; i ++ ) {
int pa = find(i);
if(!st[pa]) {
st[pa] = 1;
ans ++;
}
}
cout << ans;
return 0;
}
合根植物(蓝桥杯)
最新推荐文章于 2024-05-30 16:17:47 发布