답안 #83420 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83420	2018-11-07T13:49:58 Z	Tusk	Dango Maker (JOI18_dango_maker)	C++14	100 / 100	280 ms	119280 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[N][3], lst;
                fill_n(dp[0], N*3, 0);
                for(int i = 1, j = sum-i; i <= n; i++, j--) {
                        if(j < 1 || j > m) continue;
                        dp[i][0] = max({ dp[i-1][0], dp[i-1][1], dp[i-1][2] });
                        if(valid[i][j][0]) dp[i][1] = max(dp[i-1][0], dp[i-1][1]) + 1;
                        if(valid[i][j][1]) dp[i][2] = max(dp[i-1][0], dp[i-1][2]) + 1;
                        lst = i;
                }
                ans += max({ dp[lst][0], dp[lst][1], dp[lst][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);
                                     ~~~~~^~~~~~~~~~~~~~~
dango_maker.cpp:29:63: warning: 'lst' may be used uninitialized in this function [-Wmaybe-uninitialized]
                 ans += max({ dp[lst][0], dp[lst][1], dp[lst][2] });
                                                      ~~~~~~~~~^

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	444 KB	Output is correct
3	Correct	2 ms	648 KB	Output is correct
4	Correct	3 ms	648 KB	Output is correct
5	Correct	2 ms	720 KB	Output is correct
6	Correct	2 ms	720 KB	Output is correct
7	Correct	2 ms	720 KB	Output is correct
8	Correct	2 ms	720 KB	Output is correct
9	Correct	2 ms	732 KB	Output is correct
10	Correct	2 ms	732 KB	Output is correct
11	Correct	2 ms	732 KB	Output is correct
12	Correct	2 ms	732 KB	Output is correct
13	Correct	2 ms	732 KB	Output is correct
14	Correct	2 ms	732 KB	Output is correct
15	Correct	2 ms	732 KB	Output is correct
16	Correct	2 ms	732 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	444 KB	Output is correct
3	Correct	2 ms	648 KB	Output is correct
4	Correct	3 ms	648 KB	Output is correct
5	Correct	2 ms	720 KB	Output is correct
6	Correct	2 ms	720 KB	Output is correct
7	Correct	2 ms	720 KB	Output is correct
8	Correct	2 ms	720 KB	Output is correct
9	Correct	2 ms	732 KB	Output is correct
10	Correct	2 ms	732 KB	Output is correct
11	Correct	2 ms	732 KB	Output is correct
12	Correct	2 ms	732 KB	Output is correct
13	Correct	2 ms	732 KB	Output is correct
14	Correct	2 ms	732 KB	Output is correct
15	Correct	2 ms	732 KB	Output is correct
16	Correct	2 ms	732 KB	Output is correct
17	Correct	2 ms	732 KB	Output is correct
18	Correct	2 ms	732 KB	Output is correct
19	Correct	2 ms	732 KB	Output is correct
20	Correct	2 ms	732 KB	Output is correct
21	Correct	2 ms	736 KB	Output is correct
22	Correct	2 ms	736 KB	Output is correct
23	Correct	2 ms	736 KB	Output is correct
24	Correct	2 ms	736 KB	Output is correct
25	Correct	2 ms	788 KB	Output is correct
26	Correct	2 ms	788 KB	Output is correct
27	Correct	2 ms	788 KB	Output is correct
28	Correct	2 ms	788 KB	Output is correct
29	Correct	2 ms	788 KB	Output is correct
30	Correct	2 ms	788 KB	Output is correct
31	Correct	2 ms	788 KB	Output is correct
32	Correct	2 ms	788 KB	Output is correct
33	Correct	3 ms	788 KB	Output is correct
34	Correct	2 ms	788 KB	Output is correct
35	Correct	2 ms	896 KB	Output is correct
36	Correct	2 ms	932 KB	Output is correct
37	Correct	2 ms	932 KB	Output is correct
38	Correct	3 ms	932 KB	Output is correct
39	Correct	2 ms	932 KB	Output is correct
40	Correct	2 ms	932 KB	Output is correct
41	Correct	2 ms	932 KB	Output is correct
42	Correct	2 ms	932 KB	Output is correct
43	Correct	2 ms	932 KB	Output is correct
44	Correct	2 ms	932 KB	Output is correct
45	Correct	2 ms	936 KB	Output is correct
46	Correct	2 ms	936 KB	Output is correct
47	Correct	2 ms	936 KB	Output is correct
48	Correct	2 ms	936 KB	Output is correct
49	Correct	2 ms	936 KB	Output is correct
50	Correct	2 ms	936 KB	Output is correct
51	Correct	2 ms	936 KB	Output is correct
52	Correct	2 ms	936 KB	Output is correct
53	Correct	2 ms	936 KB	Output is correct

Subtask #3
67.0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	444 KB	Output is correct
3	Correct	2 ms	648 KB	Output is correct
4	Correct	3 ms	648 KB	Output is correct
5	Correct	2 ms	720 KB	Output is correct
6	Correct	2 ms	720 KB	Output is correct
7	Correct	2 ms	720 KB	Output is correct
8	Correct	2 ms	720 KB	Output is correct
9	Correct	2 ms	732 KB	Output is correct
10	Correct	2 ms	732 KB	Output is correct
11	Correct	2 ms	732 KB	Output is correct
12	Correct	2 ms	732 KB	Output is correct
13	Correct	2 ms	732 KB	Output is correct
14	Correct	2 ms	732 KB	Output is correct
15	Correct	2 ms	732 KB	Output is correct
16	Correct	2 ms	732 KB	Output is correct
17	Correct	2 ms	732 KB	Output is correct
18	Correct	2 ms	732 KB	Output is correct
19	Correct	2 ms	732 KB	Output is correct
20	Correct	2 ms	732 KB	Output is correct
21	Correct	2 ms	736 KB	Output is correct
22	Correct	2 ms	736 KB	Output is correct
23	Correct	2 ms	736 KB	Output is correct
24	Correct	2 ms	736 KB	Output is correct
25	Correct	2 ms	788 KB	Output is correct
26	Correct	2 ms	788 KB	Output is correct
27	Correct	2 ms	788 KB	Output is correct
28	Correct	2 ms	788 KB	Output is correct
29	Correct	2 ms	788 KB	Output is correct
30	Correct	2 ms	788 KB	Output is correct
31	Correct	2 ms	788 KB	Output is correct
32	Correct	2 ms	788 KB	Output is correct
33	Correct	3 ms	788 KB	Output is correct
34	Correct	2 ms	788 KB	Output is correct
35	Correct	2 ms	896 KB	Output is correct
36	Correct	2 ms	932 KB	Output is correct
37	Correct	2 ms	932 KB	Output is correct
38	Correct	3 ms	932 KB	Output is correct
39	Correct	2 ms	932 KB	Output is correct
40	Correct	2 ms	932 KB	Output is correct
41	Correct	2 ms	932 KB	Output is correct
42	Correct	2 ms	932 KB	Output is correct
43	Correct	2 ms	932 KB	Output is correct
44	Correct	2 ms	932 KB	Output is correct
45	Correct	2 ms	936 KB	Output is correct
46	Correct	2 ms	936 KB	Output is correct
47	Correct	2 ms	936 KB	Output is correct
48	Correct	2 ms	936 KB	Output is correct
49	Correct	2 ms	936 KB	Output is correct
50	Correct	2 ms	936 KB	Output is correct
51	Correct	2 ms	936 KB	Output is correct
52	Correct	2 ms	936 KB	Output is correct
53	Correct	2 ms	936 KB	Output is correct
54	Correct	24 ms	936 KB	Output is correct
55	Correct	33 ms	10132 KB	Output is correct
56	Correct	17 ms	10132 KB	Output is correct
57	Correct	25 ms	13884 KB	Output is correct
58	Correct	43 ms	13884 KB	Output is correct
59	Correct	268 ms	37332 KB	Output is correct
60	Correct	261 ms	46144 KB	Output is correct
61	Correct	280 ms	54952 KB	Output is correct
62	Correct	14 ms	54952 KB	Output is correct
63	Correct	273 ms	63592 KB	Output is correct
64	Correct	199 ms	72180 KB	Output is correct
65	Correct	210 ms	81008 KB	Output is correct
66	Correct	185 ms	89820 KB	Output is correct
67	Correct	170 ms	90952 KB	Output is correct
68	Correct	168 ms	99780 KB	Output is correct
69	Correct	185 ms	112304 KB	Output is correct
70	Correct	31 ms	112304 KB	Output is correct
71	Correct	30 ms	112304 KB	Output is correct
72	Correct	32 ms	112304 KB	Output is correct
73	Correct	31 ms	112304 KB	Output is correct
74	Correct	30 ms	112304 KB	Output is correct
75	Correct	31 ms	112304 KB	Output is correct
76	Correct	31 ms	112304 KB	Output is correct
77	Correct	28 ms	112304 KB	Output is correct
78	Correct	30 ms	112304 KB	Output is correct
79	Correct	29 ms	112304 KB	Output is correct
80	Correct	30 ms	112304 KB	Output is correct
81	Correct	29 ms	112304 KB	Output is correct
82	Correct	30 ms	112304 KB	Output is correct
83	Correct	28 ms	112460 KB	Output is correct
84	Correct	30 ms	113424 KB	Output is correct
85	Correct	27 ms	114348 KB	Output is correct
86	Correct	29 ms	115436 KB	Output is correct
87	Correct	29 ms	116324 KB	Output is correct
88	Correct	31 ms	117304 KB	Output is correct
89	Correct	34 ms	118368 KB	Output is correct
90	Correct	30 ms	119280 KB	Output is correct

답안 #83420

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 67.0 / 67.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
67.0 / 67.0