Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic levels are played on a board of sizen × m cells, like this:
Each cell contains a dot that has some color. We will use different uppercase Latin characters to express different colors.
The key of this game is to find a cycle that contain dots of same color. Consider 4 blue dots on the picture forming a circle as an example. Formally, we call a sequence of dotsd1, d2, ..., dk acycle if and only if it meets the following condition:
- These k dots are different: if i ≠ j then di is different fromdj.
- k is at least 4.
- All dots belong to the same color.
- For all 1 ≤ i ≤ k - 1: di and di + 1 are adjacent. Also,dk andd1 should also be adjacent. Cellsx and y are called adjacent if they share an edge.
Determine if there exists a cycle on the field.
The first line contains two integers n andm (2 ≤ n, m ≤ 50): the number of rows and columns of the board.
Then n lines follow, each line contains a string consisting ofm characters, expressing colors of dots in each line. Each character is an uppercase Latin letter.
Output "Yes" if there exists a cycle, and "No" otherwise.
3 4 AAAA ABCA AAAA
Yes
3 4 AAAA ABCA AADA
No
4 4 YYYR BYBY BBBY BBBY
Yes
7 6 AAAAAB ABBBAB ABAAAB ABABBB ABAAAB ABBBAB AAAAAB
Yes
2 13 ABCDEFGHIJKLM NOPQRSTUVWXYZ
No
In first sample test all 'A' form a cycle.
In second sample there is no such cycle.
The third sample is displayed on the picture above ('Y' = Yellow, 'B' = Blue, 'R' = Red).
#include<stdio.h>
#include<string.h>
int m,n;
int dis[8]={1,0,-1,0,0,1,0,-1};
int vis[100][100];
char ch[100][100];
int flag;
void dfs(int x,int y,int fx,int fy)
{
flag=0;
int i,j;
int tx,ty;
for(i=0;i<8;i+=2)
{
tx=x+dis[i];
ty=y+dis[i+1];
if(tx<0||ty<0||tx>=m||ty>n-1||ch[tx][ty]!=ch[x][y]||tx==fx&&ty==fy)
continue;
if(vis[tx][ty])
{
flag=1;
return ;
}
vis[tx][ty]=1;
dfs(tx,ty,x,y);
}
return ;
}
int main()
{
int i,j;
while(scanf("%d %d",&m,&n)!=EOF)
{
for(i=0;i<m;i++)
{
scanf("%s",ch[i]);
}
for(i=0;i<m&&!flag;i++)
{
for(j=0;j<n;j++)
{
memset(vis,0,sizeof(vis));
vis[i][j]=1;
dfs(i,j,i,j);
if(flag)
break;
}
}
if(flag)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}
解法二:
#include<stdio.h>
#include<string.h>
char a[200][200];
int m,n,flag;
int dir[4][2]= {0,1,1,0,0,-1,-1,0},vis[200][200];
void dfs(int x,int y,int prex,int prey)
{
int i,j,xx,yy;
for(i=0;i<4;i++)
{
xx=x+dir[i][0];
yy=y+dir[i][1];
if(xx>=0 && xx<n && yy>=0 && yy<m && a[xx][yy]==a[x][y])
{
if(xx==prex && yy==prey)
{
continue;
}
if(vis[xx][yy]==1)
{
flag=1;
break;
}
vis[xx][yy]=1;
dfs(xx,yy,x,y);
}
if(flag==1)
break;
}
return;
}
int main()
{
int i,j,u,v;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(i=0;i<n;i++)
scanf("%s",a[i]);
memset(vis,0,sizeof(vis));
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(vis[i][j]==1)
continue;
flag=0;
vis[i][j]=1;
dfs(i,j,i,j);
if(flag==1)
break;
}
if(flag==1)
break;
}
if(flag==1)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}