HDU-1198 Farm Irrigation (并查集)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1198

并查集找几个不是同一个联通的

#include<cstdio>
#include<iostream>
#define N 55
using namespace std;
int per[N][N];
char map[N][N];
int n,m;
char a[11][5]= {"1010","1001","0110","0101","1100","0011","1011","1110","0111","1101","1111"};
int find(int x) {
	if(per[x/n][x%n]!=x)
		per[x/n][x%n]=find(per[x/n][x%n]);
	return per[x/n][x%n];
}
void Union(int x,int y) {
	x=find(x);
	y=find(y);
	if(x!=y)
		per[y/n][y%n]=x;
}
void judge(int i,int j) {
	if(i>0&&a[map[i][j]-'A'][0]=='1'&&a[map[i-1][j]-'A'][1]=='1')
		Union(i*n+j,(i-1)*n+j);
	if(j>0&&a[map[i][j]-'A'][2]=='1'&&a[map[i][j-1]-'A'][3]=='1')
		Union(i*n+j,i*n+j-1);
}
int main() {
	int ans;
	while(scanf("%d%d",&m,&n)&&(m!=-1||n!=-1)) {
		for(int i=0; i<m; i++) {
			scanf("%s",map[i]);
			for(int j=0; j<n; j++)
				per[i][j]=i*n+j;
		}
		for(int i=0; i<m; i++)
			for(int j=0; j<n; j++)
				judge(i,j);
		ans=0;
		for(int i=0; i<m; i++)
			for(int j=0; j<n; j++)
				if(per[i][j]==i*n+j)
					ans++;
		printf("%d\n",ans);
	}
}