Submission #95761

# Submission time Handle Problem Language Result Execution time Memory
95761 2019-02-02T12:43:03 Z easrui None (JOI14_ho_t1) C++14
100 / 100
184 ms 6392 KB
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e3+5;
int M,N,ans,res,tmp;
char F[MAX][MAX],K[2][2],B[3]={'J','O','I'};
int C[MAX][MAX];

int match(int a, int b, int x, int y, char c)
{
    if(a<1 || a>=M || b<1 || b>=N)
        return 0;
    for(int i=0; i<2; i++)
        for(int j=0; j<2; j++) {
            if(a+i==x && b+j==y) {
                if(c!=K[i][j])
                    return 0;
            } else if(F[a+i][b+j]!=K[i][j])
                return 0;
        }
    return 1;
}

int main()
{
    //freopen("input.txt","r",stdin);
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> M >> N;
    for(int i=1; i<=M; i++)
        for(int j=1; j<=N; j++)
            cin >> F[i][j];
    for(int i=0; i<2; i++)
        for(int j=0; j<2; j++)
            cin >> K[i][j];
    for(int i=0; i<=M; i++)
        for(int j=0; j<=N; j++) {
            C[i][j] = match(i,j,i,j,F[i][j]);
            tmp += C[i][j];
        }
    ans = tmp;
    for(int i=1; i<=M; i++)
        for(int j=1; j<=N; j++)
            for(int k=0; k<3; k++) {
                res = 0;
                for(int x=-1; x<=0; x++)
                    for(int y=-1; y<=0; y++)
                        res += match(i+x,j+y,i,j,B[k]) - C[i+x][j+y];
                ans = max(ans,tmp+res);
            }
    cout << ans;
}
# Verdict Execution time Memory 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 3 ms 380 KB Output is correct
7 Correct 2 ms 376 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 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 632 KB Output is correct
18 Correct 2 ms 632 KB Output is correct
19 Correct 2 ms 632 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 632 KB Output is correct
22 Correct 2 ms 676 KB Output is correct
# Verdict Execution time Memory 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 3 ms 380 KB Output is correct
7 Correct 2 ms 376 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 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 632 KB Output is correct
18 Correct 2 ms 632 KB Output is correct
19 Correct 2 ms 632 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 632 KB Output is correct
22 Correct 2 ms 676 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 2 ms 376 KB Output is correct
27 Correct 2 ms 632 KB Output is correct
28 Correct 2 ms 632 KB Output is correct
29 Correct 2 ms 632 KB Output is correct
30 Correct 3 ms 892 KB Output is correct
31 Correct 3 ms 888 KB Output is correct
32 Correct 3 ms 888 KB Output is correct
33 Correct 4 ms 888 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 936 KB Output is correct
37 Correct 8 ms 1400 KB Output is correct
38 Correct 7 ms 1400 KB Output is correct
39 Correct 8 ms 1400 KB Output is correct
40 Correct 8 ms 1400 KB Output is correct
41 Correct 101 ms 6324 KB Output is correct
42 Correct 184 ms 6168 KB Output is correct
43 Correct 143 ms 6236 KB Output is correct
44 Correct 128 ms 6264 KB Output is correct
45 Correct 140 ms 6264 KB Output is correct
46 Correct 150 ms 6264 KB Output is correct
47 Correct 106 ms 6296 KB Output is correct
48 Correct 125 ms 6380 KB Output is correct
49 Correct 139 ms 6392 KB Output is correct
50 Correct 149 ms 6392 KB Output is correct