POJ 1164 The Castle 并查集做法

并查集做法的中心思想就是：没墙就合并到一起

#include<iostream>
#include<algorithm>
#include<set>
#include<map> 
#include<vector>
#include<string>
#define xh(a,b,c)for(int a=b;a<=c;a++)
#define dxh(a,b,c)for(int a=b;a>=c;a--)
using namespace std;
int a[64][64],m,n,y,ma;
struct zb{
    int x,y,nr;
    bool operator ==(zb a){
        return a.x==x&&a.y==y;
    }
    zb operator +=(zb a){
        nr+=a.nr;
    }
};
zb b[64][64];
vector<zb>sum;
zb up(int x,int y){
    zb s;
    s.x=x;
    s.y=y;
    if(!(b[x][y]==s))b[x][y]=up(b[x][y].x,b[x][y].y);
    return b[x][y];
}
void hb(int x1,int y1,int x2,int y2){
    if(up(x1,y1)==up(x2,y2))return;
    b[up(x1,y1).x][up(x1,y1).y]+=b[up(x2,y2).x][up(x2,y2).y];
    b[up(x2,y2).x][up(x2,y2).y]=up(x1,y1);
}
int main(){
    cin>>n>>m;
    xh(i,1,n)
        xh(j,1,m){
            b[i][j].x=i;
            b[i][j].y=j;
            cin>>a[i][j];
            b[i][j].nr=1;
        }
    xh(i,1,n)
        xh(j,1,m){
            if(a[i][j]%2==0){
                hb(i,j,i,j-1);
            }
            if(a[i][j]/2%2==0){
                hb(i,j,i-1,j);
        }
    }
    sum.clear();
    xh(i,1,n)
        xh(j,1,m){
            if(sum.empty()){
                sum.push_back(up(i,j)); 
                ma=b[i][j].nr;
                continue;
            }
            ma=max(ma,b[i][j].nr);
            y=1;
            xh(s,0,sum.size()-1)if(up(i,j)==sum[s]){
                y=0;break;
            }
            if(y){
                sum.push_back(up(i,j));
            }
        }
    cout<<sum.size()<<endl<<ma<<endl;
    return 0;
}

由于写程序时出现了一些小问题，导致代码可能有点丑，请见谅！