Fox And Two Dots

点击打开链接

B. Fox And Two Dots

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 d₁, d₂, ..., d_k a cycle if and only if it meets the following condition:

1. These k dots are different: if i ≠ j then d_i is different from d_j.
2. k is at least 4.
3. All dots belong to the same color.
4. For all 1 ≤ i ≤ k - 1: d_i and d_i + 1 are adjacent. Also, d_k and d₁ 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

题意：若能回到起点则输出Yes,否则输出No

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char a[1000][1000];
int m,n;
int ex,ey;	//记录起点的坐标，当xx==ex，yy=ey是表示回到起点，围成一个圆
int vis[1000][1000];	//标记是否被查看过 
int flag;	//如果flag=1，表示围成一个圆；flag=0，表示不是一个圆 
int fx[]={0,0,-1,1},fy[]={1,-1,0,0};	//坐标表示移动方向，上下左右 
void dfs(int x,int y,int num)
{
	int i,j;
	if(flag)	//已经是一个圆了，结束 
		return ;
	vis[x][y]=1;
	for(i=0;i<4;i++)
	{
		int xx=x+fx[i],yy=y+fy[i];
			if(xx==ex&&yy==ey&&num>3)	//围成一个圆至少要四个点，所以num要大于3 
			{
				flag=1;
				return ;
			}
			if(xx>=0&&yy>=0&&xx<m&&yy<n&&!vis[xx][yy]&&a[xx][yy]==a[x][y])	
				dfs(xx,yy,num+1);
	}
}
int main()
{
	while(~scanf("%d%d",&m,&n))
	{
		int i,j;			
		int num=1;	//记录点的个数
		flag=0; 
		for(i=0;i<m;i++)
			scanf("%s",a[i]);
		for(i=0;i<m;i++)
			for(j=0;j<n;j++)
			{
				memset(vis,0,sizeof(vis));
				ex=i;
				ey=j;
				dfs(i,j,num);
			}
		 if(flag)
		 printf("Yes\n");
		 else
		 printf("No\n");
	}
	return 0;
}