답안 #388170

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388170	2021-04-10T10:48:44 Z	blue	Dango Maker (JOI18_dango_maker)	C++17	33 / 100	1010 ms	262144 KB

dango_maker

#include <iostream>
using namespace std;

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

bool vert(long long i, long long 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(long long i, long long 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;
}

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

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

    long long res = 0;

    for(long long I = 0; I < N; I++)
    {
        dpH[I][0] = 0;
        dpV[I][0] = vert(I, 0);
        for(long long s = 0; I-s >= 0 && s < M; s++)
        {
            long long i = I-s;
            long long 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(long long J = 0; J < M; J++)
    {
        dpV[N-1][J] = 0;
        dpH[N-1][J] = horiz(N-1, J);

        for(long long s = 0; N-1-s >= 0 && J+s < M; s++)
        {
            long long i = N-1-s;
            long long 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(long long j = 0; j < M; j++) res += max(dpV[0][j], dpH[0][j]);
    for(long long i = 1; i < N; i++) res += max(dpV[i][M-1], dpH[i][M-1]);

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

Compilation message

dango_maker.cpp:27:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main()
      |      ^

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	1 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	1 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	336 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	0 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	0 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	0 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	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	0 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	332 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	1 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	1 ms	332 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	444 KB	Output is correct
50	Correct	0 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	0 ms	332 KB	Output is correct

Subtask #3
0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 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	1 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	336 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	0 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	0 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	0 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	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	0 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	332 KB	Output is correct
41	Correct	1 ms	332 KB	Output is correct
42	Correct	1 ms	332 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	1 ms	332 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	444 KB	Output is correct
50	Correct	0 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	0 ms	332 KB	Output is correct
54	Correct	1 ms	332 KB	Output is correct
55	Correct	17 ms	33340 KB	Output is correct
56	Correct	2 ms	460 KB	Output is correct
57	Correct	13 ms	22492 KB	Output is correct
58	Correct	99 ms	26908 KB	Output is correct
59	Runtime error	1010 ms	262144 KB	Execution killed with signal 11
60	Halted	0 ms	0 KB	-

답안 #388170

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 67.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 67.0