【蓝桥杯】2017年第八届真题-合根植物

#include
#include
#include
#include
using namespace std;

class Plants{
    vector pre;
public:
    Plants(){
        pre.resize(1000001);
    }
    int getNum(){
        int m,n,k;
        cin>>m>>n;
        cin>>k;
        vector> relation(k);
        for(int i=0;i> relation[i].first >> relation[i].second;
        }
        int originalNum = m*n;
        init (originalNum);
        for(int i=0;i bucket;
        for(int i=1;i<=originalNum;i++){
            int a = find(i);
            if(bucket.find(a)==bucket.end()) bucket.insert(a);
        }
        return bucket.size();
    }
    void init(int n){
        for(int i=1;i<=n;i++){
            pre[i]=i;
        }
    }
    void join(int i,int j){
        int a=find(i),b=find(j);
        if(a==b) return;
        pre[a] = b;
    }
    int find(int i){
        if(i==pre[i]) return i;
        return pre[i]=find(pre[i]);
    }
};
int main()
{
    Plants solution;
    cout << solution.getNum() << endl;
    return 0;
}