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.
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 "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
#include <stdio.h>
#include <cstring>
#include <algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define LL long long
int h,w;
char mapp[55][55];
bool vis[55][55];
int mx[4] = {0,0,1,-1};
int my[4] = {1,-1,0,0};
bool ans;
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 + mx[i];
ny = y + my[i];
if (nx == fx && ny == fy)
continue;
if (mapp[nx][ny] == mapp[x][y])
bfs(nx,ny,x,y);
}
}
int main()
{
while (~scanf ("%d %d",&h,&w))
{
ans = false;
for (int i = 1 ; i <= h ; i++)
scanf ("%s",mapp[i]+1);
CLR(vis,false);
for (int i = 1 ; i <= h ; i++)
{
for (int j = 1 ; j <= w ; j++)
{
if (!vis[i][j])
bfs(i,j,i,j);
if (ans)
break;
}
if (ans)
break;
}
printf (ans ? "Yes\n" : "No\n");
}
return 0;
}
#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX = 52;
typedef long long LL;
char s[MAX][MAX];
int n,m,vis[MAX][MAX];
int fx[4] = {0,0,-1,1},fy[4] = {-1,1,0,0},ok,ex,ey;
void dfs(int x,int y,int nl)
{
if(ok) return ;
vis[x][y] = 1;
for(int i = 0; i < 4; i++)
{
int xx = x + fx[i],yy = y + fy[i];
if(xx == ex && yy == ey && nl > 2)
{
ok = 1;
return ;
}
if(xx >= 0 && yy >= 0 && xx < n && yy < m && !vis[xx][yy] && s[xx][yy] == s[x][y])
dfs(xx,yy,nl + 1);
}
}
int main()
{
scanf("%d %d",&n,&m);
for(int i = 0; i < n; i++)
scanf("%s",s[i]);
ok = 0;
for(int i = 0; i < n && !ok; i++)
for(int j = 0; j < m && !ok; j++)
memset(vis,0,sizeof(vis)),ex = i,ey = j,dfs(i,j,0);
if(ok) puts("Yes");
else puts("No");
return 0;
}