oj.uz

Submission #55128

# Submission time Handle Problem Language Result Execution time Memory
55128 2018-07-06T05:47:41 Z 강태규(#1525) None (JOI14_ho_t1) C++11
100 / 100
 303 ms 1660 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>

using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;

int m, n;
char grid[1001][1001];
char flag[3][3];

int countFlag(int x, int y) {
    if (x <= 0 || m <= x || y <= 0 || n <= y) return 0;
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2; ++j) {
            if (grid[x - 1 + i][y - 1 + j] != flag[i][j]) return 0;
        }
    }
    return 1;
}

int countGrid(int x, int y) {
    return countFlag(x, y) + countFlag(x + 1, y)
            + countFlag(x, y + 1) + countFlag(x + 1, y + 1);
}

int changeGrid(int x, int y, char c) {
    int ret = countGrid(x, y);
    char t = grid[x][y];
    grid[x][y] = c;
    ret = countGrid(x, y) - ret;
    grid[x][y] = t;
    return ret;
}

int main() {
    scanf("%d%d", &m, &n);
    for (int i = 0; i < m; ++i) {
        scanf("%s", grid[i]);
    }
    scanf("%s", flag[0]);
    scanf("%s", flag[1]);
    int sum = 0;
    for (int i = 1; i < m; ++i) {
        for (int j = 1; j < n; ++j) {
            sum += countFlag(i, j);
        }
    }
    int ans = 0;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            ans = max({ ans, changeGrid(i, j, 'J')
                      , changeGrid(i, j, 'O'), changeGrid(i, j, 'I') });
        }
    }
    printf("%d\n", ans + sum);
	return 0;
}

Compilation message

2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &m, &n);
     ~~~~~^~~~~~~~~~~~~~~~
2014_ho_t1.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", grid[i]);
         ~~~~~^~~~~~~~~~~~~~~
2014_ho_t1.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", flag[0]);
     ~~~~~^~~~~~~~~~~~~~~
2014_ho_t1.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", flag[1]);
     ~~~~~^~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 548 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 3 ms 568 KB Output is correct
11 Correct 2 ms 568 KB Output is correct
12 Correct 2 ms 568 KB Output is correct
13 Correct 2 ms 568 KB Output is correct
14 Correct 4 ms 572 KB Output is correct
15 Correct 3 ms 572 KB Output is correct
16 Correct 3 ms 572 KB Output is correct
17 Correct 3 ms 572 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 3 ms 724 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 548 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 3 ms 568 KB Output is correct
11 Correct 2 ms 568 KB Output is correct
12 Correct 2 ms 568 KB Output is correct
13 Correct 2 ms 568 KB Output is correct
14 Correct 4 ms 572 KB Output is correct
15 Correct 3 ms 572 KB Output is correct
16 Correct 3 ms 572 KB Output is correct
17 Correct 3 ms 572 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 3 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 3 ms 724 KB Output is correct
30 Correct 4 ms 724 KB Output is correct
31 Correct 4 ms 748 KB Output is correct
32 Correct 4 ms 748 KB Output is correct
33 Correct 6 ms 748 KB Output is correct
34 Correct 2 ms 748 KB Output is correct
35 Correct 2 ms 748 KB Output is correct
36 Correct 5 ms 748 KB Output is correct
37 Correct 10 ms 764 KB Output is correct
38 Correct 9 ms 764 KB Output is correct
39 Correct 12 ms 768 KB Output is correct
40 Correct 10 ms 768 KB Output is correct
41 Correct 124 ms 1600 KB Output is correct
42 Correct 267 ms 1660 KB Output is correct
43 Correct 228 ms 1660 KB Output is correct
44 Correct 163 ms 1660 KB Output is correct
45 Correct 229 ms 1660 KB Output is correct
46 Correct 186 ms 1660 KB Output is correct
47 Correct 135 ms 1660 KB Output is correct
48 Correct 159 ms 1660 KB Output is correct
49 Correct 266 ms 1660 KB Output is correct
50 Correct 303 ms 1660 KB Output is correct