forked from b-chae/AlgorithmStudy
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path14890.cpp
More file actions
134 lines (121 loc) · 2.19 KB
/
Copy path14890.cpp
File metadata and controls
134 lines (121 loc) · 2.19 KB
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include <iostream>
using namespace std;
int N, L;
int board[100][100];
int ans = 0;
void check() {
int i, j, l;
for (i = 0; i < N; i++) {
bool res = true;
bool ladder[100] = { false, };
for (j = 0; j < N - 1; j++) {
if (board[i][j] == board[i][j + 1]) {
continue;
}
if (abs(board[i][j] - board[i][j+1]) >= 2) {
res = false;
break;
}
if (board[i][j] == board[i][j + 1] + 1) {
if (j + L >= N) {
res = false;
break;
}
for (l = j + 1; l <= j + L; l++) {
if (board[i][j + 1] != board[i][l] || ladder[l]) {
res = false;
break;
}
}
if (res) {
for (l = j + 1; l <= j + L; l++) {
ladder[l] = true;
}
}
}
else if (board[i][j] == board[i][j + 1] - 1) {
if (j + 1 - L < 0) {
res = false;
break;
}
for (l = j; l >= j + 1 - L; l--) {
if (board[i][l] != board[i][j] || ladder[l]) {
res = false;
break;
}
}
if (res) {
for (l = j; l >= j + 1 - L; l--) {
ladder[l] = true;
}
}
}
}
if (res) {
ans += 1;
}
}
for (j = 0; j < N; j++) {
bool res = true;
bool ladder[100] = { false, };
for (i = 0; i < N - 1; i++) {
if (board[i][j] == board[i + 1][j]) {
continue;
}
if (abs(board[i][j] - board[i + 1][j]) >= 2) {
res = false;
break;
}
if (board[i][j] == board[i + 1][j] + 1) {
if (i + L >= N) {
res = false;
break;
}
for (l = i + 1; l <= i + L; l++) {
if (board[i + 1][j] != board[l][j] || ladder[l]) {
res = false;
break;
}
}
if (res) {
for (l = i + 1; l <= i + L; l++) {
ladder[l] = true;
}
}
}
else if (board[i][j] == board[i + 1][j] - 1) {
if (i + 1 - L < 0) {
res = false;
break;
}
for (l = i; l >= i + 1 - L; l--) {
if (board[l][j] != board[i][j] || ladder[l]) {
res = false;
break;
}
}
if (res) {
for (l = i; l >= i + 1 - L; l--) {
ladder[l] = true;
}
}
}
}
if (res) {
ans += 1;
}
}
};
int main()
{
int i, j;
cin >> N >> L;
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
cin >> board[i][j];
}
}
check();
cout << ans;
return 0;
}