蓝桥杯 历届试题 合根植物

//#include<bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#define sdddd(x,y,z,k) scanf("%d%d%d%d", &x, &y, &z, &k)
#define sddd(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define sdd(x,y) scanf("%d%d", &x, &y)
#define sd(x) scanf("%d", &x)
//#define mp make_pair
#define pb push_back
#define lson k<<1
#define rson k<<1|1
#define mid (l+r)/2
#define ms(x, y) memset(x, y, sizeof x)
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1000050;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

int n, m, t;
int ans;
int par[maxn];
int Find(int x)
{
    if(par[x] == 0)
        return x;
    return par[maxn] = Find(par[x]);
}
void Unit(int x, int y)
{
    int fx = Find(x);
    int fy = Find(y);
    if(fx != fy)
    {
        par[fy] = fx;
    }
}
int main()
{
	cin >> n >> m >> t;
	int len = n*m +1;
	while(t--)
    {
        cin >> n >> m;
        Unit(n, m);
    }
    for(int i = 1; i < len; i++)
    {
        if(par[i] == 0)
            ans++;
    }
    cout << ans << endl;
	return 0;
}