답안 #79395 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
79395	2018-10-13T04:18:43 Z	Sherazin	Dango Maker (JOI18_dango_maker)	C++14	33 / 100	295 ms	37276 KB

dango_maker

#include <bits/stdc++.h>

using namespace std;

const int N = 3e3+5;

int n, m, ans;
char A[N][N];
bool valid[N][N][2];

int main() {
        scanf("%d %d", &n, &m);
        for(int i = 1; i <= n; i++) scanf(" %s", A[i]+1);
        for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) {
                if(A[i][j] != 'G') continue;
                if(i > 1 && i < n && A[i-1][j] == 'R' && A[i+1][j] == 'W') valid[i][j][0] = true;
                if(j > 1 && j < m && A[i][j-1] == 'R' && A[i][j+1] == 'W') valid[i][j][1] = true;
        }
        for(int sum = 2; sum <= n+m; sum++) {
                int dp[2][3], lst = 0;
                fill_n(dp[0], 2*3, 0);
                for(int i = 1; i < sum && i <= n; i++) {
                        int j = sum-i, now = i & 1, pre = now^1;
                        dp[now][0] = max({ dp[pre][0], dp[pre][1], dp[pre][2] });
                        if(valid[i][j][0]) dp[now][1] = max(dp[pre][0], dp[pre][1]) + 1;
                        if(valid[i][j][1]) dp[now][2] = max(dp[pre][0], dp[pre][2]) + 1;
                        lst = i;
                }
                ans += max({ dp[lst & 1][0], dp[lst & 1][1], dp[lst & 1][2] });
        }

        printf("%d\n", ans);

        return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &n, &m);
         ~~~~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:13:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for(int i = 1; i <= n; i++) scanf(" %s", A[i]+1);
                                     ~~~~~^~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	400 KB	Output is correct
4	Correct	2 ms	480 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	508 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	516 KB	Output is correct
10	Correct	2 ms	520 KB	Output is correct
11	Correct	2 ms	524 KB	Output is correct
12	Correct	2 ms	628 KB	Output is correct
13	Correct	2 ms	628 KB	Output is correct
14	Correct	2 ms	628 KB	Output is correct
15	Correct	2 ms	628 KB	Output is correct
16	Correct	2 ms	636 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	400 KB	Output is correct
4	Correct	2 ms	480 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	508 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	516 KB	Output is correct
10	Correct	2 ms	520 KB	Output is correct
11	Correct	2 ms	524 KB	Output is correct
12	Correct	2 ms	628 KB	Output is correct
13	Correct	2 ms	628 KB	Output is correct
14	Correct	2 ms	628 KB	Output is correct
15	Correct	2 ms	628 KB	Output is correct
16	Correct	2 ms	636 KB	Output is correct
17	Correct	2 ms	648 KB	Output is correct
18	Correct	2 ms	648 KB	Output is correct
19	Correct	2 ms	648 KB	Output is correct
20	Correct	2 ms	648 KB	Output is correct
21	Correct	2 ms	672 KB	Output is correct
22	Correct	2 ms	676 KB	Output is correct
23	Correct	2 ms	680 KB	Output is correct
24	Correct	2 ms	684 KB	Output is correct
25	Correct	3 ms	720 KB	Output is correct
26	Correct	2 ms	768 KB	Output is correct
27	Correct	2 ms	804 KB	Output is correct
28	Correct	3 ms	824 KB	Output is correct
29	Correct	2 ms	884 KB	Output is correct
30	Correct	2 ms	884 KB	Output is correct
31	Correct	2 ms	896 KB	Output is correct
32	Correct	2 ms	896 KB	Output is correct
33	Correct	2 ms	924 KB	Output is correct
34	Correct	2 ms	924 KB	Output is correct
35	Correct	2 ms	924 KB	Output is correct
36	Correct	2 ms	924 KB	Output is correct
37	Correct	2 ms	924 KB	Output is correct
38	Correct	2 ms	924 KB	Output is correct
39	Correct	2 ms	924 KB	Output is correct
40	Correct	2 ms	924 KB	Output is correct
41	Correct	2 ms	924 KB	Output is correct
42	Correct	2 ms	924 KB	Output is correct
43	Correct	2 ms	924 KB	Output is correct
44	Correct	2 ms	924 KB	Output is correct
45	Correct	2 ms	924 KB	Output is correct
46	Correct	2 ms	924 KB	Output is correct
47	Correct	2 ms	924 KB	Output is correct
48	Correct	2 ms	924 KB	Output is correct
49	Correct	2 ms	968 KB	Output is correct
50	Correct	2 ms	968 KB	Output is correct
51	Correct	2 ms	968 KB	Output is correct
52	Correct	2 ms	968 KB	Output is correct
53	Correct	3 ms	968 KB	Output is correct

Subtask #3
0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	400 KB	Output is correct
4	Correct	2 ms	480 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	508 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	516 KB	Output is correct
10	Correct	2 ms	520 KB	Output is correct
11	Correct	2 ms	524 KB	Output is correct
12	Correct	2 ms	628 KB	Output is correct
13	Correct	2 ms	628 KB	Output is correct
14	Correct	2 ms	628 KB	Output is correct
15	Correct	2 ms	628 KB	Output is correct
16	Correct	2 ms	636 KB	Output is correct
17	Correct	2 ms	648 KB	Output is correct
18	Correct	2 ms	648 KB	Output is correct
19	Correct	2 ms	648 KB	Output is correct
20	Correct	2 ms	648 KB	Output is correct
21	Correct	2 ms	672 KB	Output is correct
22	Correct	2 ms	676 KB	Output is correct
23	Correct	2 ms	680 KB	Output is correct
24	Correct	2 ms	684 KB	Output is correct
25	Correct	3 ms	720 KB	Output is correct
26	Correct	2 ms	768 KB	Output is correct
27	Correct	2 ms	804 KB	Output is correct
28	Correct	3 ms	824 KB	Output is correct
29	Correct	2 ms	884 KB	Output is correct
30	Correct	2 ms	884 KB	Output is correct
31	Correct	2 ms	896 KB	Output is correct
32	Correct	2 ms	896 KB	Output is correct
33	Correct	2 ms	924 KB	Output is correct
34	Correct	2 ms	924 KB	Output is correct
35	Correct	2 ms	924 KB	Output is correct
36	Correct	2 ms	924 KB	Output is correct
37	Correct	2 ms	924 KB	Output is correct
38	Correct	2 ms	924 KB	Output is correct
39	Correct	2 ms	924 KB	Output is correct
40	Correct	2 ms	924 KB	Output is correct
41	Correct	2 ms	924 KB	Output is correct
42	Correct	2 ms	924 KB	Output is correct
43	Correct	2 ms	924 KB	Output is correct
44	Correct	2 ms	924 KB	Output is correct
45	Correct	2 ms	924 KB	Output is correct
46	Correct	2 ms	924 KB	Output is correct
47	Correct	2 ms	924 KB	Output is correct
48	Correct	2 ms	924 KB	Output is correct
49	Correct	2 ms	968 KB	Output is correct
50	Correct	2 ms	968 KB	Output is correct
51	Correct	2 ms	968 KB	Output is correct
52	Correct	2 ms	968 KB	Output is correct
53	Correct	3 ms	968 KB	Output is correct
54	Correct	2 ms	968 KB	Output is correct
55	Correct	39 ms	10152 KB	Output is correct
56	Correct	2 ms	10152 KB	Output is correct
57	Correct	24 ms	13776 KB	Output is correct
58	Correct	31 ms	13776 KB	Output is correct
59	Incorrect	295 ms	37276 KB	Output isn't correct
60	Halted	0 ms	0 KB	-

답안 #79395

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