-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1169B.cpp
100 lines (78 loc) · 1.74 KB
/
1169B.cpp
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
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n ,m;
int count = 0;
cin >> n >> m;
int arr[m][3];
for(int i=0; i<m; i++)
{
for(int j=0; j<2;j++)
{
cin >> arr[i][j];
if(j>0)
{
if(arr[i][j-1]==arr[i][j])
{
count++;
}
}
}
}
if(count==m)
{
cout << "YES" << endl;
}
else
{
int flag = 0;
for(int i=0; i<m; i++)
{
if(flag==1)
break;
for(int j=0; j<2; j++)
{
if(i>0)
{
if(arr[i][j]==arr[i][j-1])
{
flag = 1;
break;
}
}
}
}
if(flag==1)
cout << "NO" << endl;
else
{
int count2 = 0, count1 = 0;
for(int i=0; i<m; i++)
{
if(i>0)
{
if(abs(arr[i][0]-arr[i-1][0])==1)
{
count1++;
}
}
}
for(int i=0; i<m; i++)
{
if(i>0)
{
if(abs(arr[i][1]-arr[i-1][1])==1)
{
count2++;
}
}
}
if(count1==count2)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
return 0;
}