1198 Farm Irrigation

#include <stdio.h>#define N 52int flag[11][4]={{0,1,0,1},{0,1,1,0},{1,0,0,1},{1,0,1,0},{1,1,0,0},{0,0,1,1},{0,1,1,1},{1,1,0,1},{1,0,1,1},{1,1,1,0},{1,1,1,1}};//下上右左int map[N][N];int pre[N*N];bool vis[N][N];int mo[3 ][2]={{1,0},{-1,0},{0,1}};//下 右 中间那个没用int find(int x){int r=x,temp;while(r!=pre[r]) r=pre[r];while(x!=r){temp=pre[x];pre[x]=r;x=temp;}return r;}int main (){//freopen("1.txt","r",stdin);int n,m,in,jn,t1,t2,sum,k,i,j,f1,f2,t3,t4,t;char ch;while(scanf("%d%d",&n,&m),n>0){getchar();for (i=0;i<n;i++){for (j=0;j<m;j++){scanf("%c",&ch);map[i][j]=ch-'A';vis[i][j]=0;}getchar();}t=n*m;for (i=0;i<t;i++) pre[i]=i;sum=n*m;for (i=0;i<n;i++){for (j=0;j<m;j++){t1=map[i][j];//t1 t2 是 A B C ... Kt3=m*i+j;//t3 t4 是 序号 刚开始把这两个搞混了 vis[i][j]=1;for (k=0;k<3;k++)//下 右{if (k==1) continue;t4=t3+(k==0? m:1);in=i+mo[k][0];jn=j+mo[k][1];if ( vis[in][jn]==0 && in>=0 && in<n && jn>=0 && jn<m ){t2=map[in][jn];if (flag[t1][k]==1 && flag[t2][k+1]==1)//如果t1 t2 匹配 {f1=find(t3);f2=find(t4);if (f1!=f2){pre[f1]=f2;//就把他们的序号 t3 t4 连在一起sum--;}}}}}}printf("%d/n",sum);}}