【CodeForces】510B - Fox And Two Dots（bfs）

Fox Ciel is playing a mobile puzzle game called “Two Dots”. The basic levels are played on a board of size n × 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 dots d1, d2, …, dk a cycle if and only if it meets the following condition:

These k dots are different: if i ≠ j then di is different from dj.
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 and d1 should also be adjacent. Cells x and y are called adjacent if they share an edge.
Determine if there exists a cycle on the field.

Input
The first line contains two integers n and m (2 ≤ n, m ≤ 50): the number of rows and columns of the board.

Then n lines follow, each line contains a string consisting of m characters, expressing colors of dots in each line. Each character is an uppercase Latin letter.

Output
Output “Yes” if there exists a cycle, and “No” otherwise.

Examples
Input
3 4
AAAA
ABCA
AAAA
Output
Yes
Input
3 4
AAAA
ABCA
AADA
Output
No
Input
4 4
YYYR
BYBY
BBBY
BBBY
Output
Yes
Input
7 6
AAAAAB
ABBBAB
ABAAAB
ABABBB
ABAAAB
ABBBAB
AAAAAB
Output
Yes
Input
2 13
ABCDEFGHIJKLM
NOPQRSTUVWXYZ
Output
No
Note
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).

从前到最后进行一次bfs，在每一个点向四周搜索（但是不能走回头路），每搜到一个点就用vis标记一下。

如果搜到了vis标记过的点，而且和这个点是同一种颜色，那么说明肯定成环了，说明就成立。

代码如下：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int N=60;
char tu[N][N];
int vis[N][N];
int d[4][2]={0,1,1,0,0,-1,-1,0};
int n,m;
int ans;
void bfs(int x,int y,int nx,int ny)
{
	if(vis[x][y]){
		ans=1;
		return ;
	}
	vis[x][y]=1;
	int xx,yy;
	for(int i=0;i<4;i++){
		xx=x+d[i][0];
		yy=y+d[i][1];
		if(xx==nx&&yy==ny)continue;
		if(tu[xx][yy]==tu[x][y])
			bfs(xx,yy,x,y);
	}
}
int main()
{	
	cin>>n>>m;
	for(int i=0;i<n;i++)
	for(int j=0;j<m;j++)
	cin>>tu[i][j];
	memset(vis,0,sizeof(vis));
	ans=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(!vis[i][j])bfs(i,j,i,j);
			if(ans)break;
		}
		if(ans)break;
	}
	if(ans)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
}