#include <bits/stdc++.h>
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define Mup(x,y) x = max(x,y)
#define mup(x,y) x = min(x,y)
#define all(x) begin(x),end(x)
#define per(i,a,b) for (auto i = (b); i >= (a); --i)
using namespace std;
const int N = 1003, M = 1003;
int n, m;
char f[N][M], s[3][3];
bool valid(int x, int y) {
rep(i,0,1) rep(j,0,1) if (f[x+i][y+j] != s[i][j]) return false;
return true;
}
int main() {
scanf("%d%d", &n, &m);
rep(i,1,n) scanf(" %s ", f[i]+1);
scanf("%c%c %c%c", &s[0][0],&s[0][1],&s[1][0],&s[1][1]);
int diff = 0;
rep(i,1,n) rep(j,1,m) {
int minus = 0, plus = 0;
char tmp = f[i][j];
rep(x,0,1) rep(y,0,1) minus += valid(i-x,j-y);
for (char c : {'J','O','I'}) {
f[i][j] = c;
int p = 0;
rep(x,0,1) rep(y,0,1) p += valid(i-x,j-y);
Mup(plus, p);
}
Mup(diff, plus-minus);
f[i][j] = tmp;
}
int val = 0;
rep(i,1,n-1) rep(j,1,m-1) {
val += valid(i,j);
}
// printf("%d+(%d)", val,diff);
printf("%d", val+diff);
}
Compilation message
2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
19 | scanf("%d%d", &n, &m);
| ~~~~~^~~~~~~~~~~~~~~~
2014_ho_t1.cpp:20:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
20 | rep(i,1,n) scanf(" %s ", f[i]+1);
| ~~~~~^~~~~~~~~~~~~~~~
2014_ho_t1.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
21 | scanf("%c%c %c%c", &s[0][0],&s[0][1],&s[1][0],&s[1][1]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
332 KB |
Output is correct |
| 14 |
Correct |
0 ms |
340 KB |
Output is correct |
| 15 |
Correct |
0 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
1 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
352 KB |
Output is correct |
| 20 |
Correct |
0 ms |
340 KB |
Output is correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
332 KB |
Output is correct |
| 14 |
Correct |
0 ms |
340 KB |
Output is correct |
| 15 |
Correct |
0 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
1 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
352 KB |
Output is correct |
| 20 |
Correct |
0 ms |
340 KB |
Output is correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
0 ms |
212 KB |
Output is correct |
| 24 |
Correct |
0 ms |
212 KB |
Output is correct |
| 25 |
Correct |
0 ms |
212 KB |
Output is correct |
| 26 |
Correct |
1 ms |
212 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
1 ms |
280 KB |
Output is correct |
| 29 |
Correct |
0 ms |
340 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
1 ms |
340 KB |
Output is correct |
| 32 |
Correct |
1 ms |
340 KB |
Output is correct |
| 33 |
Correct |
1 ms |
340 KB |
Output is correct |
| 34 |
Correct |
0 ms |
212 KB |
Output is correct |
| 35 |
Correct |
0 ms |
212 KB |
Output is correct |
| 36 |
Correct |
1 ms |
340 KB |
Output is correct |
| 37 |
Correct |
2 ms |
468 KB |
Output is correct |
| 38 |
Correct |
1 ms |
468 KB |
Output is correct |
| 39 |
Correct |
3 ms |
468 KB |
Output is correct |
| 40 |
Correct |
2 ms |
468 KB |
Output is correct |
| 41 |
Correct |
16 ms |
1284 KB |
Output is correct |
| 42 |
Correct |
49 ms |
1236 KB |
Output is correct |
| 43 |
Correct |
42 ms |
1236 KB |
Output is correct |
| 44 |
Correct |
29 ms |
1236 KB |
Output is correct |
| 45 |
Correct |
42 ms |
1236 KB |
Output is correct |
| 46 |
Correct |
49 ms |
1236 KB |
Output is correct |
| 47 |
Correct |
18 ms |
1236 KB |
Output is correct |
| 48 |
Correct |
32 ms |
1236 KB |
Output is correct |
| 49 |
Correct |
41 ms |
1236 KB |
Output is correct |
| 50 |
Correct |
48 ms |
1236 KB |
Output is correct |
