ACM/Hw1_2.cpp at master · bardia13/ACM · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <iostream>
using namespace std ;

#define MAXN 500

int n,m ;
char in[MAXN][MAXN] ;
int flag[MAXN][MAXN] ;

bool dfsv(int i, int j,int pi,int pj){
	flag[i][j] = 1 ;
	if (i-1 >= 0 && in[i-1][j] == in[i][j])
		if ( flag[i-1][j] != 1)
			return dfsv(i-1,j,i,j) ;
		else if (i-1 != pi || j != pj ){
			return true ;
		}
	if (j-1 >= 0 && in[i][j-1] == in[i][j])
		if (flag[i][j-1] != 1)
			return dfsv(i,j-1,i,j) ;
		else if ( i != pi || j-1 != pj)
			return true ;
	if (j+1 < m && in[i][j+1] == in[i][j])
		if (flag[i][j+1] != 1)
			return dfsv(i,j+1,i,j) ;
		else if (i != pi || j+1 != pj)
			return true ;
	if (i+1 < n && in[i+1][j] == in[i][j])
		if (flag[i+1][j] != 1)
			return dfsv(i+1,j,i,j) ;
		else if (i+1 != pi || j != pj)
			return true ;
	return false ;
}

int main(){
	cin >> n >> m  ;

	for (int i = 0;i < n;i++){
		string x ;
		cin >> x ;
		for (int j = 0 ;j < x.size() ;j++){
			in[i][j] = x[j] ;
		}
	}

	for (int i = 0 ;i < n;i++){
		for (int j = 0 ;j < m ;j++){
			if (flag[i][j] != 1){
				if (dfsv(i,j,i,j)){
					cout << "Yes" << endl ;
					return 0 ;
				}
			}
		}
	}


	cout << "No" << endl ;


	return 0 ;
}