Submission #55127

# Submission time Handle Problem Language Result Execution time Memory
55127 2018-07-06T05:45:55 Z 노영훈(#1526) None (JOI14_ho_t1) C++11
100 / 100
237 ms 1660 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=500010, inf=2e9;

int n, m;
char B[1010][1010], C[3][3];
int A[1010][1010];
int ans=0;

bool flag(int x, int y){
    if(x<1 || m<=x || y<1 || n<=y) return false;
    for(int i=0; i<=1; i++)
        for(int j=0; j<=1; j++)
            if(B[x+i][y+j]!=C[i][j]) return false;
    return true;
}

int solve(int x, int y, char c){
    char prv=B[x][y];
    int res=0;
    for(int i=-1; i<=0; i++)
        for(int j=-1; j<=0; j++)
            res-=flag(x+i,y+j);
    B[x][y]=c;
    for(int i=-1; i<=0; i++)
        for(int j=-1; j<=0; j++)
            res+=flag(x+i,y+j);
    B[x][y]=prv;
    return res;
}

int main(){
    ios::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>>B[i][j];
    cin>>C[0][0]>>C[0][1]>>C[1][0]>>C[1][1];
    for(int i=1; i<m; i++)
        for(int j=1; j<n; j++){
            ans+=flag(i,j);
        }
    int mx=0;
    for(int i=1; i<=m; i++)
        for(int j=1; j<=n; j++){
            mx=max(mx, solve(i,j,'J'));
            mx=max(mx, solve(i,j,'O'));
            mx=max(mx, solve(i,j,'I'));
        }
    cout<<ans+mx;
    return 0;
}
# 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 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 3 ms 616 KB Output is correct
18 Correct 2 ms 616 KB Output is correct
19 Correct 3 ms 616 KB Output is correct
20 Correct 3 ms 616 KB Output is correct
21 Correct 2 ms 680 KB Output is correct
22 Correct 4 ms 680 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 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 3 ms 616 KB Output is correct
18 Correct 2 ms 616 KB Output is correct
19 Correct 3 ms 616 KB Output is correct
20 Correct 3 ms 616 KB Output is correct
21 Correct 2 ms 680 KB Output is correct
22 Correct 4 ms 680 KB Output is correct
23 Correct 2 ms 680 KB Output is correct
24 Correct 3 ms 680 KB Output is correct
25 Correct 2 ms 680 KB Output is correct
26 Correct 3 ms 680 KB Output is correct
27 Correct 3 ms 680 KB Output is correct
28 Correct 3 ms 680 KB Output is correct
29 Correct 3 ms 680 KB Output is correct
30 Correct 4 ms 680 KB Output is correct
31 Correct 4 ms 680 KB Output is correct
32 Correct 4 ms 680 KB Output is correct
33 Correct 4 ms 680 KB Output is correct
34 Correct 2 ms 680 KB Output is correct
35 Correct 2 ms 680 KB Output is correct
36 Correct 3 ms 680 KB Output is correct
37 Correct 9 ms 764 KB Output is correct
38 Correct 7 ms 764 KB Output is correct
39 Correct 9 ms 764 KB Output is correct
40 Correct 9 ms 764 KB Output is correct
41 Correct 145 ms 1660 KB Output is correct
42 Correct 204 ms 1660 KB Output is correct
43 Correct 212 ms 1660 KB Output is correct
44 Correct 176 ms 1660 KB Output is correct
45 Correct 196 ms 1660 KB Output is correct
46 Correct 185 ms 1660 KB Output is correct
47 Correct 122 ms 1660 KB Output is correct
48 Correct 145 ms 1660 KB Output is correct
49 Correct 237 ms 1660 KB Output is correct
50 Correct 201 ms 1660 KB Output is correct