【BFS】Fox And Two Dots

B. Fox And Two Dots

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:

1. These k dots are different: if i ≠ j then di is different from dj.
2. k is at least 4.
3. All dots belong to the same color.
4. 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进行操作。

在探索时走的每一步只有可能是四个方向，分别是上下左右(0,1),(1,0)(0,-1),(-1,0).我们将其方向放到数组中

int to[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};

没走过一个点，都用vised[i][j]来标记。用两种方式来判断这个图片是否是闭合回路，当再次遇到vised[i][j]为true，并且与最初的我们比较的字符相等时，即可跳出循环，有闭合回路。

void bfs(int x,int y,int fx,int fy){
	if(vis[x][y]){
		ans = true;
		return ;
	}
	vis[x][y] = true;
	int nx,ny;
	for(int i=0;i<4;i++){
		nx = x + to[i][0];
		ny = y + to[i][1];
		if(nx == fx && ny == fy)
			continue;
		if(mapp[nx][ny] == mapp[x][y])
			bfs(nx,ny,x,y);
	}
}

完整代码：

#include <bits/stdc++.h>

using namespace std;

char mapp[55][55];
bool vised[55][55];
int to[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};

void bfs(int x,int y,int fx,int fy){
	if(vis[x][y]){
		ans = true;
		return ;
	}
	vis[x][y] = true;
	int nx,ny;
	for(int i=0;i<4;i++){
		nx = x + to[i][0];
		ny = y + to[i][1];
		if(nx == fx && ny == fy)
			continue;
		if(mapp[nx][ny] == mapp[x][y])
			bfs(nx,ny,x,y);
	}
}

int main(){
	int n,m;
	while(~scanf("%d %d",&n,&m)){
		bool ans = false;
		for(int i=1;i<=n;i++)
			scanf("%s",mapp[i]+1);
		memset(vised,false,sizeof(vised));
		int nx,ny;
		for(int i=1;i<=x;i++){
			for(int j=1;j<=m;j++){
				if(!vis[i][j]){
					bfs(i,j,i,j);
				}
				if(ans)
					break;
			}
			if(ans)
				break;
		}
		printf(ans ? "Yes\n" : "No\n");
	}
	return 0;
}