-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path14890.cpp
More file actions
116 lines (104 loc) · 1.59 KB
/
14890.cpp
File metadata and controls
116 lines (104 loc) · 1.59 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
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cstring>
#include <string>
using namespace std;
int n;
int l;
int arr[100][100];
int res = 0;
int main() {
cin >> n >> l;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < n; i++) {
int cnt_h = 1;
int cnt_l = l;
int f = 0;
int val = arr[i][0];
for (int j = 1; j < n; j++) {
int val2 = arr[i][j];
if (val2 - val == 0) {
cnt_h++; cnt_l++;
}
else if (val2 - val == 1) {
if (cnt_h - l < 0) {
cnt_h = -1;
break;
}
f = 1;
cnt_h = 1;
cnt_l = 1;
}
else if (val2 - val == -1) {
if (f == 2) {
if (cnt_l - l < 0) {
cnt_h = -1;
break;
}
}
f = 2;
cnt_h = 1 - l;
cnt_l = 1;
}
else {
cnt_h = -1;
break;
}
val = val2;
}
if (cnt_h >= 0) {
res++;
}
}
for (int i = 0; i < n; i++) {
int cnt_h = 1;
int cnt_l = l;
int f = 0;
int val = arr[0][i];
for (int j = 1; j < n; j++) {
int val2 = arr[j][i];
if (val2 - val == 0) {
cnt_h++; cnt_l++;
}
else if (val2 - val == 1) {
if (cnt_h - l < 0) {
cnt_h = -1;
break;
}
f = 1;
cnt_h = 1;
cnt_l = 1;
}
else if (val2 - val == -1) {
if (f == 2) {
if (cnt_l - l < 0) {
cnt_h = -1;
break;
}
}
f = 2;
cnt_h = 1 - l;
cnt_l = 1;
}
else {
cnt_h = -1;
break;
}
val = val2;
}
if (cnt_h >= 0) {
res++;
}
}
cout << res;
}