#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
int N, M, S, ans;
char A[1010][1010];
char E[2][2];
int chk(int x, int y){
if (A[x][y] != E[0][0]) return 0;
if (A[x][y+1] != E[0][1]) return 0;
if (A[x+1][y] != E[1][0]) return 0;
if (A[x+1][y+1] != E[1][1]) return 0;
return 1;
}
int main(){
scanf("%d %d", &N, &M);
for (int i=1; i<=N; i++) scanf("%s", A[i]+1);
scanf("%s", E[0]);
scanf("%s", E[1]);
for (int i=1; i<=N-1; i++) for (int j=1; j<=M-1; j++) S += chk(i, j);
ans = S;
for (int i=1; i<=N; i++) for (int j=1; j<=M; j++){
int cnt = 0;
char ch = A[i][j];
cnt -= chk(i-1, j-1);
cnt -= chk(i-1, j);
cnt -= chk(i, j-1);
cnt -= chk(i, j);
A[i][j] = 'J';
cnt += chk(i-1, j-1);
cnt += chk(i-1, j);
cnt += chk(i, j-1);
cnt += chk(i, j);
ans = max(ans, S+cnt);
cnt -= chk(i-1, j-1);
cnt -= chk(i-1, j);
cnt -= chk(i, j-1);
cnt -= chk(i, j);
A[i][j] = 'O';
cnt += chk(i-1, j-1);
cnt += chk(i-1, j);
cnt += chk(i, j-1);
cnt += chk(i, j);
ans = max(ans, S+cnt);
cnt -= chk(i-1, j-1);
cnt -= chk(i-1, j);
cnt -= chk(i, j-1);
cnt -= chk(i, j);
A[i][j] = 'I';
cnt += chk(i-1, j-1);
cnt += chk(i-1, j);
cnt += chk(i, j-1);
cnt += chk(i, j);
ans = max(ans, S+cnt);
cnt -= chk(i-1, j-1);
cnt -= chk(i-1, j);
cnt -= chk(i, j-1);
cnt -= chk(i, j);
A[i][j] = ch;
}
printf("%d\n", ans);
return 0;
}
Compilation message
2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &N, &M);
~~~~~^~~~~~~~~~~~~~~~~
2014_ho_t1.cpp:20:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for (int i=1; i<=N; i++) scanf("%s", A[i]+1);
~~~~~^~~~~~~~~~~~~~
2014_ho_t1.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", E[0]);
~~~~~^~~~~~~~~~~~
2014_ho_t1.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", E[1]);
~~~~~^~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
296 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
380 KB |
Output is correct |
16 |
Correct |
3 ms |
376 KB |
Output is correct |
17 |
Correct |
3 ms |
376 KB |
Output is correct |
18 |
Correct |
2 ms |
376 KB |
Output is correct |
19 |
Correct |
2 ms |
376 KB |
Output is correct |
20 |
Correct |
2 ms |
376 KB |
Output is correct |
21 |
Correct |
2 ms |
376 KB |
Output is correct |
22 |
Correct |
2 ms |
380 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
296 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
380 KB |
Output is correct |
16 |
Correct |
3 ms |
376 KB |
Output is correct |
17 |
Correct |
3 ms |
376 KB |
Output is correct |
18 |
Correct |
2 ms |
376 KB |
Output is correct |
19 |
Correct |
2 ms |
376 KB |
Output is correct |
20 |
Correct |
2 ms |
376 KB |
Output is correct |
21 |
Correct |
2 ms |
376 KB |
Output is correct |
22 |
Correct |
2 ms |
380 KB |
Output is correct |
23 |
Correct |
2 ms |
348 KB |
Output is correct |
24 |
Correct |
2 ms |
376 KB |
Output is correct |
25 |
Correct |
3 ms |
376 KB |
Output is correct |
26 |
Correct |
2 ms |
376 KB |
Output is correct |
27 |
Correct |
2 ms |
376 KB |
Output is correct |
28 |
Correct |
2 ms |
376 KB |
Output is correct |
29 |
Correct |
3 ms |
376 KB |
Output is correct |
30 |
Correct |
3 ms |
504 KB |
Output is correct |
31 |
Correct |
3 ms |
504 KB |
Output is correct |
32 |
Correct |
3 ms |
376 KB |
Output is correct |
33 |
Correct |
3 ms |
504 KB |
Output is correct |
34 |
Correct |
2 ms |
376 KB |
Output is correct |
35 |
Correct |
2 ms |
376 KB |
Output is correct |
36 |
Correct |
3 ms |
504 KB |
Output is correct |
37 |
Correct |
6 ms |
632 KB |
Output is correct |
38 |
Correct |
3 ms |
632 KB |
Output is correct |
39 |
Correct |
6 ms |
632 KB |
Output is correct |
40 |
Correct |
5 ms |
632 KB |
Output is correct |
41 |
Correct |
25 ms |
2296 KB |
Output is correct |
42 |
Correct |
90 ms |
2424 KB |
Output is correct |
43 |
Correct |
85 ms |
2296 KB |
Output is correct |
44 |
Correct |
52 ms |
2300 KB |
Output is correct |
45 |
Correct |
76 ms |
2296 KB |
Output is correct |
46 |
Correct |
78 ms |
2300 KB |
Output is correct |
47 |
Correct |
27 ms |
2300 KB |
Output is correct |
48 |
Correct |
58 ms |
2296 KB |
Output is correct |
49 |
Correct |
74 ms |
2296 KB |
Output is correct |
50 |
Correct |
87 ms |
2296 KB |
Output is correct |