CF510B：Fox And Two Dots（dfs）

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

题意：给个二维地图，问是否有环。

思路：入门dfs.

# include <bits/stdc++.h>
using namespace std;
char s[53][53];
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int vis[53][53], n, m, flag=0;
void dfs(int x, int y, int pre)
{
    if(flag) return;
    vis[x][y] = 1;
    for(int i=0; i<4; ++i)
    {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if(nx < 0 || ny < 0 || nx >= n || ny >= m || (s[nx][ny] != s[x][y]) || (i+2)%4==pre) continue;
        if(vis[nx][ny])
        {
            flag = 1;
            return;
        }
        dfs(nx, ny, i);
    }
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=0; i<n; ++i)
    {
        scanf("%s",s[i]);
    }
    for(int i=0; i<n; ++i)
    {
        for(int j=0; j<m; ++j)
        {
            if(!vis[i][j])
            {
                dfs(i, j, -1);
                if(flag) return 0*puts("Yes");
            }
        }
    }
    puts("No");
    return 0;
}