Submission #722023

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
722023	2023-04-11T10:35:33 Z	dozer	Dango Maker (JOI18_dango_maker)	C++14	33 / 100	480 ms	262144 KB

dango_maker

#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n";
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 6005

const int modulo = 1e9 + 7;

char arr[N][N];
int dp[N][N][2][2];
int ho[N][N], ver[N][N];


int32_t main()
{
	fastio();

	int n, m;
	cin>>n>>m;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			cin>>arr[i][j];
		}
	}

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m - 2; j++) 
			if (arr[i][j] == 'R' && arr[i][j + 1] == 'G' && arr[i][j + 2] == 'W') ho[i][j] = 1;

	for (int i = 1; i <= n - 2; i++)
		for (int j = 1; j <= m; j++) 
			if (arr[i][j] == 'R' && arr[i + 1][j] == 'G' && arr[i + 2][j] == 'W') ver[i][j] = 1;


	int ans = 0;
	for (int i = 1; i <= n + m; i++)
	{
		int lw = max((int)1, i - n);
		int up = min(i - 1, m);
		for (int j = up; j >= lw; j--)
		{
			for (int k = 0; k < 2; k++)
			{
				for (int l = 0; l < 2; l++)
				{
					int t1 = dp[i][j + 1][0][k], t2 = 0, t3 = 0;
					if (ho[i - j][j]) t2 = dp[i][j + 1][1][k] + 1;
					if (ver[i - j][j] && (k | l) == 0) t3 = dp[i][j + 1][0][k] + 1;
					dp[i][j][k][l] = max(t1, max(t2, t3)); 
				}
			}
		}
		//cout<<i<<sp<<lw<<sp<<up<<" :"<<dp[i][lw][0][0]<<endl;
		ans += dp[i][lw][0][0];
	}
	cout<<ans<<endl;

	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " seconds\n";
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 67.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	324 KB	Output is correct
10	Correct	0 ms	328 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	468 KB	Output is correct
20	Correct	1 ms	468 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	452 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	452 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	1 ms	468 KB	Output is correct
29	Correct	1 ms	468 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	468 KB	Output is correct
33	Correct	1 ms	468 KB	Output is correct
34	Correct	1 ms	456 KB	Output is correct
35	Correct	1 ms	456 KB	Output is correct
36	Correct	1 ms	456 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	1 ms	452 KB	Output is correct
39	Correct	1 ms	456 KB	Output is correct
40	Correct	1 ms	468 KB	Output is correct
41	Correct	1 ms	468 KB	Output is correct
42	Correct	1 ms	468 KB	Output is correct
43	Correct	1 ms	468 KB	Output is correct
44	Correct	1 ms	468 KB	Output is correct
45	Correct	1 ms	452 KB	Output is correct
46	Correct	1 ms	468 KB	Output is correct
47	Correct	1 ms	468 KB	Output is correct
48	Correct	1 ms	456 KB	Output is correct
49	Correct	1 ms	452 KB	Output is correct
50	Correct	1 ms	468 KB	Output is correct
51	Correct	1 ms	460 KB	Output is correct
52	Correct	1 ms	452 KB	Output is correct
53	Correct	1 ms	468 KB	Output is correct
54	Correct	8 ms	12884 KB	Output is correct
55	Correct	19 ms	25552 KB	Output is correct
56	Correct	8 ms	13272 KB	Output is correct
57	Correct	14 ms	27092 KB	Output is correct
58	Correct	64 ms	45736 KB	Output is correct
59	Runtime error	480 ms	262144 KB	Execution killed with signal 9
60	Halted	0 ms	0 KB	-

Submission #722023

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