codeforces-solution/1101A.cpp at master · AmHackish/codeforces-solution · 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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#include <bits/stdc++.h>

using namespace std;
int main()
{
	int t;
	cin >> t;
	vector<vector<char> > a(t,vector<char> (t));
	for(int i=0;i<t;i++)
		for(int j=0;j<t;j++)
			cin >> a[i][j];
	if(a.size()>1)
	{
		for(int i=0;i<t;i++)
		{
			for(int j=0;j<t;j++)
			{
				int cnt=0;
				if(i == 0 and j==0)
				{
					if(a[i+1][j] == 'o')
						cnt++;
					if(a[i][j+1] == 'o')
						cnt++;
				}
				else if(i == 0 and j==t-1)
				{
					if(a[i+1][j] == 'o')
						cnt++;
					if(a[i][j-1] =='o')
						cnt++;
				}
				else if(i == t-1 and j==0)
				{
					if(a[i-1][j]=='o')
						cnt++;
					if(a[i][j+1]=='o')
						cnt++;
				}
				else if(i==t-1 and j==t-1)
				{
					if(a[i-1][j]=='o')
						cnt++;
					if(a[i][j-1]=='o')
						cnt++;
				}
				else if(i==0)
				{
					if(a[i+1][j]=='o')
						cnt++;
					if(a[i][j+1]=='o')
						cnt++;
					if(a[i][j-1]=='o')
						cnt++;
				}
				else if(j ==0)
				{
					if(a[i+1][j]=='o')
						cnt++;
					if(a[i][j+1]=='o')
						cnt++;
					if(a[i-1][j]=='o')
						cnt++;
				}
				else if(i == t-1)
				{
					if(a[i-1][j]=='o')
						cnt++;
					if(a[i][j+1]=='o')
						cnt++;
					if(a[i][j-1]=='o')
						cnt++;
				}
				else if(j == t-1)
				{
					if(a[i-1][j]=='o')
						cnt++;
					if(a[i+1][j]=='o')
						cnt++;
					if(a[i][j-1]=='o')
						cnt++;
				}
				else
				{
					if(a[i+1][j]=='o')
						cnt++;
					if(a[i-1][j]=='o')
						cnt++;
					if(a[i][j-1]=='o')
						cnt++;
					if(a[i][j+1]=='o')
						cnt++;
				}
				if(cnt%2 !=0)
				{
					cout << "NO" << endl;
					return 0;
				}
			}
		}
	}
	cout << "YES" << endl;
	return 0;
}