hdu 1198

这道题其实相当水，只是一个简单的并查集就可以了，但是悲惨的是本人居然花了两天才把它给K了，真是不容易啊，一个致命的错误就是输入时str[i][j]中j最小为0，到下面就稀里糊涂的写成j从1开始了，发现时还真是撕心裂肺啊，脑子短路了。。。。

# include<stdio.h>
# include<string.h>
int p[3000];
int find(int x)
{
	if(x!=p[x])
	{
		p[x]=find(p[x]);
	}
	return p[x];
}

int judge1(char left,char right)
{
	if((left=='B')||(left=='D')||(left=='F')||(left=='G')||(left=='I')||(left=='J')||(left=='K'))
		if((right=='A')||(right=='C')||(right=='F')||(right=='G')||(right=='H')||(right=='I')||(right=='K'))
			return 1;
	return 0;
}

int judge2(char up,char down)
{
	if((up=='C')||(up=='D')||(up=='E')||(up=='H')||(up=='I')||(up=='J')||(up=='K'))
		if((down=='A')||(down=='B')||(down=='E')||(down=='G')||(down=='H')||(down=='J')||(down=='K'))
			return 1;
	return 0;
}
void main()
{
	int n,m,i,j,t;
	char str[55][55];
	while(scanf("%d%d",&m,&n)&&(n>0)&&(m>0))
	{
		for(i=0;i<m;i++)
		{
			scanf("%s",str[i]);
		}
		for(i=0;i<n*m;i++)
			p[i]=i;

		for(i=0;i<m;i++)
			for(j=0;j<n;j++)
			{
				if((i-1)!=-1)
				{
					if(judge2(str[i-1][j],str[i][j]))
						if(find(n*i+j)!=find(n*(i-1)+j))
						{
							p[find(n*i+j)]=find(n*(i-1)+j);
						}
				}
				if((i+1)<m)
				{
					if(judge2(str[i][j],str[i+1][j]))
						if(find(n*i+j)!=find(n*(i+1)+j))
						{
							p[find(n*i+j)]=find(n*(i+1)+j);
						}
				}
				if((j-1)!=-1)
				{
					if(judge1(str[i][j-1],str[i][j]))
						if(find(n*i+j-1)!=find(n*i+j))
						{
							p[find(n*i+j-1)]=find(n*i+j);
						}
				}
				if((j+1)<n)
				{
					if(judge1(str[i][j],str[i][j+1]))
						if(find(n*i+j)!=find(n*i+j+1))
						{
							p[find(n*i+j)]=find(n*i+j+1);
						}
				}
			}

		for(i=0,t=0;i<n*m;i++)
		{
			if(find(i)==i)
				t++;
		}
		printf("%d\n",t);
	}
}