oj.uz

Submission #388168

# Submission time Handle Problem Language Result Execution time Memory
388168 2021-04-10T10:46:37 Z blue Dango Maker (JOI18_dango_maker) C++17
33 / 100
 808 ms 88368 KB 
#include <iostream>
using namespace std;

int dpV[3000][3000];
int dpH[3000][3000];
char grid[3000][3000];
int N, M;

bool vert(int i, int j)
{
    if(i == 0 || i == N-1) return 0;
    if(grid[i-1][j] != 'R') return 0;
    if(grid[i][j] != 'G') return 0;
    if(grid[i+1][j] != 'W') return 0;
    return 1;
}

bool horiz(int i, int j)
{
    if(j == 0 || j == M-1) return 0;
    if(grid[i][j-1] != 'R') return 0;
    if(grid[i][j] != 'G') return 0;
    if(grid[i][j+1] != 'W') return 0;
    return 1;
}

int main()
{
    cin >> N >> M;

    for(int i = 0; i < N; i++) for(int j = 0; j < M; j++) cin >> grid[i][j];

    int res = 0;

    for(int I = 0; I < N; I++)
    {
        dpH[I][0] = 0;
        dpV[I][0] = vert(I, 0);
        for(int s = 0; I-s >= 0 && s < M; s++)
        {
            int i = I-s;
            int j = s;

            dpH[i][j] = max(dpH[i+1][j-1], dpV[i+1][j-1]);
            dpH[i][j] = max(dpH[i][j], dpH[i+1][j-1] + horiz(i, j));

            dpV[i][j] = max(dpH[i+1][j-1], dpV[i+1][j-1]);
            dpV[i][j] = max(dpV[i][j], dpV[i+1][j-1] + vert(i, j));
        }
    }

    for(int J = 0; J < M; J++)
    {
        dpV[N-1][J] = 0;
        dpH[N-1][J] = horiz(N-1, J);

        for(int s = 0; N-1-s >= 0 && J+s < M; s++)
        {
            int i = N-1-s;
            int j = J+s;

            dpH[i][j] = max(dpH[i+1][j-1], dpV[i+1][j-1]);
            dpH[i][j] = max(dpH[i][j], dpH[i+1][j-1] + horiz(i, j));

            dpV[i][j] = max(dpH[i+1][j-1], dpV[i+1][j-1]);
            dpV[i][j] = max(dpV[i][j], dpV[i+1][j-1] + vert(i, j));
        }
    }

    for(int j = 0; j < M; j++) res += max(dpV[0][j], dpH[0][j]);
    for(int i = 1; i < N; i++) res += max(dpV[i][M-1], dpH[i][M-1]);

    cout << res << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 296 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 380 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 296 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 380 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 18 ms 33228 KB Output is correct
56 Correct 2 ms 460 KB Output is correct
57 Correct 16 ms 22220 KB Output is correct
58 Correct 95 ms 19908 KB Output is correct
59 Incorrect 808 ms 88368 KB Output isn't correct
60 Halted 0 ms 0 KB -