oj.uz

답안 #485619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
485619 2021-11-08T15:15:59 Z Cross_Ratio JOI 문장 (JOI14_ho_t1) C++14
100 / 100
 134 ms 2368 KB 
#include <bits/stdc++.h>
using namespace std;
signed main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int M, N;
    cin >> M >> N;
    int i, j;
    vector<string> S;
    for(i=0;i<M;i++) {
        string s;
        cin >> s;
        S.push_back(s);
    }
    int cnt = 0;
    string F[2];
    cin >> F[0] >> F[1];
    for(i=0;i<M-1;i++) {
        for(j=0;j<N-1;j++) {
            bool isPos = true;
            for(int k = 0; k < 4; k++) {
                if(S[i+k/2][j+k%2]!=F[k/2][k%2]) isPos = false;
            }
            if(isPos) cnt++;
        }
    }
    //cout << cnt << '\n';
    int ans = cnt;
    string s3 = "JOI";
    for(i=0;i<M;i++) {
        for(j=0;j<N;j++) {
            int cnt2 = 0;
            //cout << i << ' ' << j << '\n';
            for(int x = max(0,i-1);x<=min(i,M-2);x++) {
                for(int y = max(0,j-1);y<=min(j,N-2);y++) {
                    bool isPos = true;
                    for(int k = 0; k < 4; k++) {
                        if(S[x+k/2][y+k%2]!=F[k/2][k%2]) isPos = false;
                    }
                    if(isPos) cnt2++;
                }
            }
            //cout << "Check\n";
            char c = S[i][j];
            for(int m = 0; m < 3; m++) {
                S[i][j] = s3[m];
                int cnt3 = 0;
                for(int x = max(0,i-1);x<=min(i,M-2);x++) {
                    for(int y = max(0,j-1);y<=min(j,N-2);y++) {
                        bool isPos = true;
                        for(int k = 0; k < 4; k++) {
                            if(S[x+k/2][y+k%2]!=F[k/2][k%2]) isPos = false;
                        }
                        if(isPos) cnt3++;
                    }
                }
                ans = max(ans, cnt - cnt2 + cnt3);
            }
            S[i][j] = c;
        }
    }
    cout << ans;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 320 KB Output is correct
33 Correct 2 ms 316 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 2 ms 320 KB Output is correct
37 Correct 6 ms 404 KB Output is correct
38 Correct 6 ms 332 KB Output is correct
39 Correct 5 ms 332 KB Output is correct
40 Correct 5 ms 408 KB Output is correct
41 Correct 129 ms 2344 KB Output is correct
42 Correct 128 ms 2252 KB Output is correct
43 Correct 127 ms 2348 KB Output is correct
44 Correct 132 ms 2252 KB Output is correct
45 Correct 125 ms 2344 KB Output is correct
46 Correct 125 ms 2344 KB Output is correct
47 Correct 126 ms 2340 KB Output is correct
48 Correct 134 ms 2344 KB Output is correct
49 Correct 129 ms 2356 KB Output is correct
50 Correct 124 ms 2368 KB Output is correct