Submission #241673

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
241673	2020-06-25T08:28:49 Z	ChrisT	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	569 ms	132856 KB

dango_maker

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pib = pair<int,bool>;
using ll = long long;
using ld = long double;
#define all(x) (x).begin(),(x).end()
#ifdef fread_unlocked
#define fread fread_unlocked
#define fwrite fwrite_unlocked
#endif
#define mp make_pair
#define lc ind<<1
#define rc ind<<1|1
const int MN = 3e3+5, MOD = 1e9+7, BASE = 31, MASK = (1 << 13) - 1;
char grid[MN][MN]; bool canDown[MN][MN], canRight[MN][MN]; int dp[MN][MN][3];
int main () {
	int n,m,ret = 0;
	scanf ("%d %d",&n,&m);
	for (int i = 1; i <= n; i++) {
		scanf ("%s",grid[i]+1);
		for (int j = 1; j <= m-2; j++) if (grid[i][j] == 'R' && grid[i][j+1] == 'G' && grid[i][j+2] == 'W') {
			canRight[i][j+1] = 1;
		}
	}
	for (int j = 1; j <= m; j++) {
		for (int i = 1; i <= n-2; i++) if (grid[i][j] == 'R' && grid[i+1][j] == 'G' && grid[i+2][j] == 'W') {
			canDown[i+1][j] = 1;
		}
	}
	for (int v = 2; v <= n+m; v++) { // i + j = v
		int add = 0;
		for (int i = 1; i <= n; i++) {
			int j = v - i;
			if (1 <= j && j <= m) {
				dp[i][j][0] = max({dp[i-1][j+1][0],dp[i-1][j+1][1],dp[i-1][j+1][2]});
				if (canRight[i][j]) dp[i][j][1] = max(dp[i-1][j+1][0],dp[i-1][j+1][1]) + 1; 
				if (canDown[i][j]) dp[i][j][2] = max(dp[i-1][j+1][0],dp[i-1][j+1][2]) + 1;
				add = max({add,dp[i][j][0],dp[i][j][1],dp[i][j][2]});
			}
		}
		ret += add;
	}
	printf ("%d\n",ret);
	return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:19:8: 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:21:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%s",grid[i]+1);
   ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 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	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 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	5 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	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 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	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 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	5 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	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 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	512 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 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	5 ms	416 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	512 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	5 ms	512 KB	Output is correct
38	Correct	5 ms	512 KB	Output is correct
39	Correct	5 ms	512 KB	Output is correct
40	Correct	5 ms	512 KB	Output is correct
41	Correct	5 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	512 KB	Output is correct
51	Correct	5 ms	512 KB	Output is correct
52	Correct	5 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	5 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	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 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	5 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	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 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	512 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 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	5 ms	416 KB	Output is correct
30	Correct	5 ms	384 KB	Output is correct
31	Correct	5 ms	512 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	5 ms	512 KB	Output is correct
38	Correct	5 ms	512 KB	Output is correct
39	Correct	5 ms	512 KB	Output is correct
40	Correct	5 ms	512 KB	Output is correct
41	Correct	5 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	512 KB	Output is correct
51	Correct	5 ms	512 KB	Output is correct
52	Correct	5 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	27 ms	21760 KB	Output is correct
56	Correct	5 ms	640 KB	Output is correct
57	Correct	21 ms	22784 KB	Output is correct
58	Correct	64 ms	24952 KB	Output is correct
59	Correct	565 ms	132728 KB	Output is correct
60	Correct	569 ms	132584 KB	Output is correct
61	Correct	559 ms	132728 KB	Output is correct
62	Correct	5 ms	384 KB	Output is correct
63	Correct	534 ms	132856 KB	Output is correct
64	Correct	511 ms	132576 KB	Output is correct
65	Correct	503 ms	132604 KB	Output is correct
66	Correct	513 ms	132728 KB	Output is correct
67	Correct	471 ms	124392 KB	Output is correct
68	Correct	472 ms	124508 KB	Output is correct
69	Correct	506 ms	131012 KB	Output is correct
70	Correct	53 ms	25980 KB	Output is correct
71	Correct	52 ms	26008 KB	Output is correct
72	Correct	55 ms	25932 KB	Output is correct
73	Correct	53 ms	25852 KB	Output is correct
74	Correct	53 ms	25848 KB	Output is correct
75	Correct	54 ms	25848 KB	Output is correct
76	Correct	53 ms	25976 KB	Output is correct
77	Correct	53 ms	25848 KB	Output is correct
78	Correct	53 ms	25848 KB	Output is correct
79	Correct	53 ms	25848 KB	Output is correct
80	Correct	53 ms	25848 KB	Output is correct
81	Correct	54 ms	25976 KB	Output is correct
82	Correct	54 ms	25976 KB	Output is correct
83	Correct	54 ms	25848 KB	Output is correct
84	Correct	54 ms	25848 KB	Output is correct
85	Correct	54 ms	25848 KB	Output is correct
86	Correct	58 ms	25848 KB	Output is correct
87	Correct	54 ms	25848 KB	Output is correct
88	Correct	56 ms	25848 KB	Output is correct
89	Correct	55 ms	25848 KB	Output is correct
90	Correct	54 ms	25976 KB	Output is correct

Submission #241673

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