Submission #219163

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
219163	2020-04-03T22:06:47 Z	AQT	Dango Maker (JOI18_dango_maker)	C++14	100 / 100	627 ms	124024 KB

dango_maker

#include <bits/stdc++.h>

using namespace std;

int N, M;
char arr[3005][3005];
int dp[3][3005][3005]; //0 ntg, 1 hor, 2 ver

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> M;	
	for(int i = 1; i<=N; i++){
		for(int j = 1; j<=M; j++){
			cin >> arr[i][j];
		}
	}
	int lst = 0, pre = 0;
	for(int d = 2; d<=N+M; d++){
		for(int r = 1; r<=N; r++){
			int c = d-r;
			if(c <= 0 || c > M){
				continue;
			}
			dp[0][r][c] = max({lst, dp[0][r-1][c+1], dp[1][r-1][c+1], dp[2][r-1][c+1]});
			if(arr[r][c] == 'G' && arr[r][c-1] == 'R' && arr[r][c+1] == 'W'){
				dp[1][r][c] = max({dp[0][r-1][c+1], dp[1][r-1][c+1], pre}) + 1;
			}
			if(arr[r][c] == 'G' && arr[r-1][c] == 'R' && arr[r+1][c] == 'W'){
				dp[2][r][c] = max({dp[0][r-1][c+1], dp[2][r-1][c+1], pre}) + 1;
			}
			lst = max({dp[0][r][c], dp[1][r][c], dp[2][r][c]});
		}
		pre = lst;
	}
	cout << pre << "\n";
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	6 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	4 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	416 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	512 KB	Output is correct
21	Correct	5 ms	512 KB	Output is correct
22	Correct	5 ms	512 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Correct	5 ms	512 KB	Output is correct
28	Correct	5 ms	512 KB	Output is correct
29	Correct	4 ms	512 KB	Output is correct
30	Correct	5 ms	512 KB	Output is correct
31	Correct	5 ms	384 KB	Output is correct
32	Correct	5 ms	384 KB	Output is correct
33	Correct	5 ms	512 KB	Output is correct
34	Correct	5 ms	512 KB	Output is correct
35	Correct	5 ms	512 KB	Output is correct
36	Correct	5 ms	512 KB	Output is correct
37	Correct	4 ms	512 KB	Output is correct
38	Correct	4 ms	512 KB	Output is correct
39	Correct	4 ms	512 KB	Output is correct
40	Correct	5 ms	512 KB	Output is correct
41	Correct	4 ms	512 KB	Output is correct
42	Correct	5 ms	512 KB	Output is correct
43	Correct	5 ms	512 KB	Output is correct
44	Correct	5 ms	512 KB	Output is correct
45	Correct	5 ms	512 KB	Output is correct
46	Correct	5 ms	512 KB	Output is correct
47	Correct	5 ms	512 KB	Output is correct
48	Correct	5 ms	512 KB	Output is correct
49	Correct	5 ms	512 KB	Output is correct
50	Correct	5 ms	640 KB	Output is correct
51	Correct	13 ms	564 KB	Output is correct
52	Correct	4 ms	512 KB	Output is correct
53	Correct	5 ms	512 KB	Output is correct
54	Correct	5 ms	384 KB	Output is correct
55	Correct	28 ms	21760 KB	Output is correct
56	Correct	5 ms	512 KB	Output is correct
57	Correct	23 ms	24320 KB	Output is correct
58	Correct	76 ms	27768 KB	Output is correct
59	Correct	607 ms	123768 KB	Output is correct
60	Correct	608 ms	123900 KB	Output is correct
61	Correct	627 ms	124024 KB	Output is correct
62	Correct	5 ms	384 KB	Output is correct
63	Correct	596 ms	123512 KB	Output is correct
64	Correct	590 ms	123896 KB	Output is correct
65	Correct	595 ms	123952 KB	Output is correct
66	Correct	606 ms	123896 KB	Output is correct
67	Correct	508 ms	69112 KB	Output is correct
68	Correct	503 ms	69304 KB	Output is correct
69	Correct	521 ms	79224 KB	Output is correct
70	Correct	74 ms	28152 KB	Output is correct
71	Correct	73 ms	28024 KB	Output is correct
72	Correct	73 ms	28024 KB	Output is correct
73	Correct	74 ms	28024 KB	Output is correct
74	Correct	77 ms	28024 KB	Output is correct
75	Correct	74 ms	28024 KB	Output is correct
76	Correct	77 ms	28024 KB	Output is correct
77	Correct	75 ms	28024 KB	Output is correct
78	Correct	80 ms	28024 KB	Output is correct
79	Correct	83 ms	28052 KB	Output is correct
80	Correct	80 ms	28024 KB	Output is correct
81	Correct	74 ms	28024 KB	Output is correct
82	Correct	75 ms	28024 KB	Output is correct
83	Correct	80 ms	28072 KB	Output is correct
84	Correct	75 ms	28024 KB	Output is correct
85	Correct	73 ms	28024 KB	Output is correct
86	Correct	75 ms	28024 KB	Output is correct
87	Correct	78 ms	28048 KB	Output is correct
88	Correct	76 ms	28024 KB	Output is correct
89	Correct	76 ms	28024 KB	Output is correct
90	Correct	74 ms	28024 KB	Output is correct

Submission #219163

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