oj.uz

Submission #366092

# Submission time Handle Problem Language Result Execution time Memory
366092 2021-02-13T05:00:15 Z dolphingarlic None (JOI14_ho_t1) C++14
30 / 100
 1000 ms 1388 KB 
#include <bits/stdc++.h>
using namespace std;

char opt[3]{'J', 'O', 'I'};
string grid[1000], emblem[2];
unordered_map<string, int> cnt;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> grid[i];
    for (int i = 1; i < n; i++) for (int j = 1; j < m; j++) {
        cnt[grid[i - 1].substr(j - 1, 2) + grid[i].substr(j - 1, 2)]++;
    }
    cin >> emblem[0] >> emblem[1];
    int ans = 0;
    for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) {
        for (int k = 0; k < 3; k++) {
            if (i && j) cnt[grid[i - 1].substr(j - 1, 2) + grid[i].substr(j - 1, 2)]--;
            if (i && j < m - 1) cnt[grid[i - 1].substr(j, 2) + grid[i].substr(j, 2)]--;
            if (i < n - 1 && j) cnt[grid[i].substr(j - 1, 2) + grid[i + 1].substr(j - 1, 2)]--;
            if (i < n - 1 && j < m - 1) cnt[grid[i].substr(j, 2) + grid[i + 1].substr(j, 2)]--;
            char tmp = grid[i][j];
            grid[i][j] = opt[k];
            if (i && j) cnt[grid[i - 1].substr(j - 1, 2) + grid[i].substr(j - 1, 2)]++;
            if (i && j < m - 1) cnt[grid[i - 1].substr(j, 2) + grid[i].substr(j, 2)]++;
            if (i < n - 1 && j) cnt[grid[i].substr(j - 1, 2) + grid[i + 1].substr(j - 1, 2)]++;
            if (i < n - 1 && j < m - 1) cnt[grid[i].substr(j, 2) + grid[i + 1].substr(j, 2)]++;
            ans = max(ans, cnt[emblem[0] + emblem[1]]);
            if (i && j) cnt[grid[i - 1].substr(j - 1, 2) + grid[i].substr(j - 1, 2)]--;
            if (i && j < m - 1) cnt[grid[i - 1].substr(j, 2) + grid[i].substr(j, 2)]--;
            if (i < n - 1 && j) cnt[grid[i].substr(j - 1, 2) + grid[i + 1].substr(j - 1, 2)]--;
            if (i < n - 1 && j < m - 1) cnt[grid[i].substr(j, 2) + grid[i + 1].substr(j, 2)]--;
            grid[i][j] = tmp;
            if (i && j) cnt[grid[i - 1].substr(j - 1, 2) + grid[i].substr(j - 1, 2)]++;
            if (i && j < m - 1) cnt[grid[i - 1].substr(j, 2) + grid[i].substr(j, 2)]++;
            if (i < n - 1 && j) cnt[grid[i].substr(j - 1, 2) + grid[i + 1].substr(j - 1, 2)]++;
            if (i < n - 1 && j < m - 1) cnt[grid[i].substr(j, 2) + grid[i + 1].substr(j, 2)]++;
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 4 ms 364 KB Output is correct
14 Correct 4 ms 364 KB Output is correct
15 Correct 7 ms 364 KB Output is correct
16 Correct 10 ms 364 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 11 ms 364 KB Output is correct
19 Correct 12 ms 364 KB Output is correct
20 Correct 9 ms 364 KB Output is correct
21 Correct 11 ms 364 KB Output is correct
22 Correct 11 ms 364 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 4 ms 364 KB Output is correct
14 Correct 4 ms 364 KB Output is correct
15 Correct 7 ms 364 KB Output is correct
16 Correct 10 ms 364 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 11 ms 364 KB Output is correct
19 Correct 12 ms 364 KB Output is correct
20 Correct 9 ms 364 KB Output is correct
21 Correct 11 ms 364 KB Output is correct
22 Correct 11 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 9 ms 364 KB Output is correct
28 Correct 11 ms 364 KB Output is correct
29 Correct 10 ms 492 KB Output is correct
30 Correct 46 ms 364 KB Output is correct
31 Correct 43 ms 364 KB Output is correct
32 Correct 42 ms 364 KB Output is correct
33 Correct 41 ms 492 KB Output is correct
34 Correct 0 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 42 ms 492 KB Output is correct
37 Correct 186 ms 480 KB Output is correct
38 Correct 183 ms 492 KB Output is correct
39 Correct 163 ms 364 KB Output is correct
40 Correct 172 ms 364 KB Output is correct
41 Execution timed out 1089 ms 1388 KB Time limit exceeded
42 Halted 0 ms 0 KB -