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:

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).

#include <iostream>
#include <cstring>

using namespace std;

int n,m;
int sx,sy;
char s[51][51];
bool vis[51][51],flag;
int step[4][2]={{0,1},{0,-1},{1,0},{-1,0}};

void dfs(int x,int y,int cnt)
{
    if(flag)    return;

    vis[x][y]=1;
    for(int i=0;i<4;i++)
    {
        int tx=x+step[i][0];
        int ty=y+step[i][1];
        if(tx==sx&&ty==sy&&cnt>=4)
        {
            flag=true;
            return;
        }
        if(tx>=0&&tx<n&&ty>=0&&ty<m&&!vis[tx][ty]&&s[tx][ty]==s[x][y])  dfs(tx,ty,cnt+1);
    }
}

int main()
{
    while(cin>>n>>m)
    {
        flag=false;
        for(int i=0;i<n;i++)    cin>>s[i];
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                memset(vis,0,sizeof(vis));
                sx=i,sy=j;
                dfs(i,j,1);
            }
        }
        cout<<(flag ? "Yes":"No")<<endl;
    }
    return 0;
}