답안 #153888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153888 2019-09-17T10:54:06 Z arnold518 JOI 문장 (JOI14_ho_t1) C++14
100 / 100
94 ms 2364 KB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1000;

int N, M, ans;
char S[MAXN+10][MAXN+10], T[3][3];

int chk(int y, int x)
{
    int i, j;
    for(i=0; i<2; i++) for(j=0; j<2; j++) if(S[y+i][x+j]!=T[i][j]) return 0;
    return 1;
}

int main()
{
    int i, j;

    scanf("%d%d", &N, &M);
    for(i=1; i<=N; i++) scanf("%s", S[i]+1);
    for(i=0; i<2; i++) scanf("%s", T[i]);

    int cnt=0;
    for(i=1; i<=N; i++) for(j=1; j<=M; j++) cnt+=chk(i, j);
    ans=cnt;

    for(i=1; i<=N; i++) for(j=1; j<=M; j++)
    {
        char t=S[i][j];
        cnt-=chk(i-1, j-1)+chk(i-1, j)+chk(i, j-1)+chk(i, j);
        S[i][j]='J';
        cnt+=chk(i-1, j-1)+chk(i-1, j)+chk(i, j-1)+chk(i, j);
        ans=max(ans, cnt);

        cnt-=chk(i-1, j-1)+chk(i-1, j)+chk(i, j-1)+chk(i, j);
        S[i][j]='O';
        cnt+=chk(i-1, j-1)+chk(i-1, j)+chk(i, j-1)+chk(i, j);
        ans=max(ans, cnt);

        cnt-=chk(i-1, j-1)+chk(i-1, j)+chk(i, j-1)+chk(i, j);
        S[i][j]='I';
        cnt+=chk(i-1, j-1)+chk(i-1, j)+chk(i, j-1)+chk(i, j);
        ans=max(ans, cnt);

        cnt-=chk(i-1, j-1)+chk(i-1, j)+chk(i, j-1)+chk(i, j);
        S[i][j]=t;
        cnt+=chk(i-1, j-1)+chk(i-1, j)+chk(i, j-1)+chk(i, j);
    }
    printf("%d", ans);
}

Compilation message

2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:24:10: 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:25:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=N; i++) scanf("%s", S[i]+1);
                         ~~~~~^~~~~~~~~~~~~~
2014_ho_t1.cpp:26:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=0; i<2; i++) scanf("%s", T[i]);
                        ~~~~~^~~~~~~~~~~~
# 결과 실행 시간 메모리 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 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 320 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 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 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 404 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 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 320 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 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 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 404 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 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 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 504 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 256 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 6 ms 504 KB Output is correct
38 Correct 4 ms 504 KB Output is correct
39 Correct 6 ms 612 KB Output is correct
40 Correct 6 ms 632 KB Output is correct
41 Correct 56 ms 2296 KB Output is correct
42 Correct 92 ms 2296 KB Output is correct
43 Correct 91 ms 2296 KB Output is correct
44 Correct 71 ms 2328 KB Output is correct
45 Correct 90 ms 2296 KB Output is correct
46 Correct 94 ms 2296 KB Output is correct
47 Correct 58 ms 2296 KB Output is correct
48 Correct 74 ms 2336 KB Output is correct
49 Correct 90 ms 2296 KB Output is correct
50 Correct 93 ms 2364 KB Output is correct