답안 #98638 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98638	2019-02-25T02:15:03 Z	PeppaPig	Dango Maker (JOI18_dango_maker)	C++14	100 / 100	299 ms	35704 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	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	412 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	3 ms	428 KB	Output is correct
15	Correct	3 ms	368 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	412 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	3 ms	428 KB	Output is correct
15	Correct	3 ms	368 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	2 ms	412 KB	Output is correct
18	Correct	3 ms	384 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	428 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	472 KB	Output is correct
32	Correct	3 ms	420 KB	Output is correct
33	Correct	3 ms	412 KB	Output is correct
34	Correct	3 ms	384 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	3 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	3 ms	384 KB	Output is correct
42	Correct	3 ms	484 KB	Output is correct
43	Correct	2 ms	476 KB	Output is correct
44	Correct	4 ms	384 KB	Output is correct
45	Correct	2 ms	520 KB	Output is correct
46	Correct	3 ms	512 KB	Output is correct
47	Correct	2 ms	484 KB	Output is correct
48	Correct	2 ms	384 KB	Output is correct
49	Correct	3 ms	384 KB	Output is correct
50	Correct	2 ms	512 KB	Output is correct
51	Correct	2 ms	384 KB	Output is correct
52	Correct	2 ms	384 KB	Output is correct
53	Correct	3 ms	384 KB	Output is correct

Subtask #3
67.0 / 67.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	412 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	3 ms	428 KB	Output is correct
15	Correct	3 ms	368 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	2 ms	412 KB	Output is correct
18	Correct	3 ms	384 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	428 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	472 KB	Output is correct
32	Correct	3 ms	420 KB	Output is correct
33	Correct	3 ms	412 KB	Output is correct
34	Correct	3 ms	384 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	3 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	3 ms	384 KB	Output is correct
42	Correct	3 ms	484 KB	Output is correct
43	Correct	2 ms	476 KB	Output is correct
44	Correct	4 ms	384 KB	Output is correct
45	Correct	2 ms	520 KB	Output is correct
46	Correct	3 ms	512 KB	Output is correct
47	Correct	2 ms	484 KB	Output is correct
48	Correct	2 ms	384 KB	Output is correct
49	Correct	3 ms	384 KB	Output is correct
50	Correct	2 ms	512 KB	Output is correct
51	Correct	2 ms	384 KB	Output is correct
52	Correct	2 ms	384 KB	Output is correct
53	Correct	3 ms	384 KB	Output is correct
54	Correct	15 ms	384 KB	Output is correct
55	Correct	32 ms	9572 KB	Output is correct
56	Correct	19 ms	476 KB	Output is correct
57	Correct	24 ms	13304 KB	Output is correct
58	Correct	40 ms	10104 KB	Output is correct
59	Correct	256 ms	35576 KB	Output is correct
60	Correct	283 ms	35700 KB	Output is correct
61	Correct	253 ms	35576 KB	Output is correct
62	Correct	13 ms	384 KB	Output is correct
63	Correct	299 ms	35504 KB	Output is correct
64	Correct	205 ms	35700 KB	Output is correct
65	Correct	207 ms	35576 KB	Output is correct
66	Correct	207 ms	35704 KB	Output is correct
67	Correct	168 ms	28076 KB	Output is correct
68	Correct	154 ms	27896 KB	Output is correct
69	Correct	217 ms	31716 KB	Output is correct
70	Correct	36 ms	10232 KB	Output is correct
71	Correct	37 ms	10112 KB	Output is correct
72	Correct	31 ms	10112 KB	Output is correct
73	Correct	36 ms	10084 KB	Output is correct
74	Correct	37 ms	10108 KB	Output is correct
75	Correct	31 ms	10212 KB	Output is correct
76	Correct	37 ms	10184 KB	Output is correct
77	Correct	28 ms	10112 KB	Output is correct
78	Correct	32 ms	10104 KB	Output is correct
79	Correct	38 ms	10360 KB	Output is correct
80	Correct	42 ms	10276 KB	Output is correct
81	Correct	33 ms	10112 KB	Output is correct
82	Correct	40 ms	10232 KB	Output is correct
83	Correct	32 ms	10188 KB	Output is correct
84	Correct	31 ms	10184 KB	Output is correct
85	Correct	39 ms	10112 KB	Output is correct
86	Correct	42 ms	10232 KB	Output is correct
87	Correct	43 ms	10232 KB	Output is correct
88	Correct	31 ms	10112 KB	Output is correct
89	Correct	39 ms	10104 KB	Output is correct
90	Correct	32 ms	10112 KB	Output is correct

답안 #98638

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