Submission #98407

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
98407	2019-02-22T21:44:04 Z	MatheusLealV	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	100 / 100	143 ms	99064 KB

joi2019_ho_t3

#include <bits/stdc++.h>
#define N 402
using namespace std;

int n, v[N], pos[3][N], sz[3], inf = 2000000000, ans = 2000000000;

int dp[N][N][N][3], dij[N][N], diz[N][N], dji[N][N], dzi[N][N], djz[N][N], dzj[N][N];

int solve()
{
	for(int i = 0; i <= sz[0]; i++)
	{
		for(int j = 0; j <= sz[1]; j++)
		{
			for(int z = 0; z <= sz[2]; z++)
			{
				for(int lst = 0; lst <= 2; lst ++)
				{
						if(!i and !j and !z)
						{
							dp[i][j][z][lst] = 0;

							continue;
						}

						int A = inf, B = inf, C = inf, di = 0, dj = 0, dz = 0;

						if(i > 0 and lst != 0) A = dp[i - 1][j][z][0]+ abs(i + j + z - pos[0][i] + di + dij[i][j + 1] + diz[i][z + 1]);

						if(j > 0 and lst != 1) B = dp[i][j - 1][z][1] + abs(i + j + z - pos[1][j] + dj + dji[i + 1][j] + djz[z + 1][j]);
						
						if(z > 0 and lst != 2) C = dp[i][j][z - 1][2] + abs(i + j + z - pos[2][z] + dz + dzi[i + 1][z] + dzj[z][j + 1]);

						dp[i][j][z][lst] = min({A, B, C});

						if(i + j + z == n) ans = min(ans, dp[i][j][z][lst]);
				}	
			}
		}
	}

	return ans;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n;

	for(int i = 1; i <= n; i++)
	{
		char c;

		cin>>c;

		if(c == 'R') v[i] = 0;

		else if(c == 'Y') v[i] = 1;

		else v[i] = 2;

		++sz[v[i]];

		pos[v[i]][sz[v[i]]] = i;
	}

	for(int i = sz[0]; i >= 1; i--)
	{
		for(int a = sz[1]; a >= 1; a--)
		{
			if(pos[1][a] < pos[0][i]) dij[i][a] = dij[i][a + 1] + 1;

			else dij[i][a] = dij[i][a + 1];

			if(pos[0][i] < pos[1][a]) dji[i][a] = dji[i + 1][a] + 1;

			else dji[i][a] = dji[i + 1][a];
		}

		for(int a = sz[2]; a >= 1; a--)
		{
			if(pos[2][a] < pos[0][i]) diz[i][a] = diz[i][a + 1] + 1;

			else diz[i][a] = diz[i][a + 1];

			if(pos[0][i] < pos[2][a]) dzi[i][a] = dzi[i + 1][a] + 1;

			else dzi[i][a] = dzi[i + 1][a];
		}
	}

	for(int z = sz[2]; z >= 1; z--)
	{
		for(int j = sz[1]; j >= 1; j--)
		{
			if(pos[1][j] < pos[2][z]) dzj[z][j] = dzj[z][j + 1] + 1;

			else dzj[z][j] = dzj[z][j + 1];

			if(pos[2][z] < pos[1][j]) djz[z][j] = djz[z + 1][j] + 1;

			else djz[z][j] = djz[z + 1][j];
		}
	}

	int ans = solve();

	cout<<(ans >= inf ? -1 : ans)<<"\n";
}

Subtask #1
5.0 / 5.0

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

Subtask #2
55.0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	640 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	640 KB	Output is correct
8	Correct	2 ms	640 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	2 ms	508 KB	Output is correct
11	Correct	2 ms	512 KB	Output is correct
12	Correct	2 ms	640 KB	Output is correct
13	Correct	2 ms	512 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	3 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	4 ms	2688 KB	Output is correct
19	Correct	5 ms	2688 KB	Output is correct
20	Correct	4 ms	2816 KB	Output is correct
21	Correct	4 ms	2432 KB	Output is correct
22	Correct	29 ms	3328 KB	Output is correct
23	Correct	3 ms	2304 KB	Output is correct
24	Correct	3 ms	1664 KB	Output is correct
25	Correct	3 ms	1152 KB	Output is correct
26	Correct	3 ms	1024 KB	Output is correct
27	Correct	4 ms	2176 KB	Output is correct
28	Correct	4 ms	2544 KB	Output is correct
29	Correct	4 ms	2688 KB	Output is correct
30	Correct	3 ms	2176 KB	Output is correct
31	Correct	5 ms	2176 KB	Output is correct
32	Correct	4 ms	2176 KB	Output is correct
33	Correct	3 ms	1024 KB	Output is correct
34	Correct	2 ms	1152 KB	Output is correct
35	Correct	3 ms	2048 KB	Output is correct
36	Correct	4 ms	2816 KB	Output is correct
37	Correct	3 ms	1920 KB	Output is correct
38	Correct	5 ms	1920 KB	Output is correct
39	Correct	4 ms	2304 KB	Output is correct
40	Correct	2 ms	640 KB	Output is correct
41	Correct	3 ms	896 KB	Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	512 KB	Output is correct
5	Correct	2 ms	640 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	640 KB	Output is correct
8	Correct	2 ms	640 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	2 ms	508 KB	Output is correct
11	Correct	2 ms	512 KB	Output is correct
12	Correct	2 ms	640 KB	Output is correct
13	Correct	2 ms	512 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	3 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	4 ms	2688 KB	Output is correct
19	Correct	5 ms	2688 KB	Output is correct
20	Correct	4 ms	2816 KB	Output is correct
21	Correct	4 ms	2432 KB	Output is correct
22	Correct	29 ms	3328 KB	Output is correct
23	Correct	3 ms	2304 KB	Output is correct
24	Correct	3 ms	1664 KB	Output is correct
25	Correct	3 ms	1152 KB	Output is correct
26	Correct	3 ms	1024 KB	Output is correct
27	Correct	4 ms	2176 KB	Output is correct
28	Correct	4 ms	2544 KB	Output is correct
29	Correct	4 ms	2688 KB	Output is correct
30	Correct	3 ms	2176 KB	Output is correct
31	Correct	5 ms	2176 KB	Output is correct
32	Correct	4 ms	2176 KB	Output is correct
33	Correct	3 ms	1024 KB	Output is correct
34	Correct	2 ms	1152 KB	Output is correct
35	Correct	3 ms	2048 KB	Output is correct
36	Correct	4 ms	2816 KB	Output is correct
37	Correct	3 ms	1920 KB	Output is correct
38	Correct	5 ms	1920 KB	Output is correct
39	Correct	4 ms	2304 KB	Output is correct
40	Correct	2 ms	640 KB	Output is correct
41	Correct	3 ms	896 KB	Output is correct
42	Correct	2 ms	384 KB	Output is correct
43	Correct	6 ms	3044 KB	Output is correct
44	Correct	5 ms	2944 KB	Output is correct
45	Correct	8 ms	2944 KB	Output is correct
46	Correct	5 ms	2944 KB	Output is correct
47	Correct	4 ms	2944 KB	Output is correct
48	Correct	5 ms	2944 KB	Output is correct
49	Correct	5 ms	3072 KB	Output is correct
50	Correct	7 ms	2944 KB	Output is correct
51	Correct	5 ms	2944 KB	Output is correct
52	Correct	6 ms	2944 KB	Output is correct
53	Correct	3 ms	1664 KB	Output is correct
54	Correct	5 ms	2048 KB	Output is correct
55	Correct	4 ms	2432 KB	Output is correct
56	Correct	5 ms	3072 KB	Output is correct
57	Correct	5 ms	3072 KB	Output is correct
58	Correct	127 ms	90288 KB	Output is correct
59	Correct	143 ms	83704 KB	Output is correct
60	Correct	113 ms	89820 KB	Output is correct
61	Correct	111 ms	88056 KB	Output is correct
62	Correct	12 ms	8448 KB	Output is correct
63	Correct	17 ms	11520 KB	Output is correct
64	Correct	47 ms	34040 KB	Output is correct
65	Correct	79 ms	46584 KB	Output is correct
66	Correct	117 ms	87544 KB	Output is correct
67	Correct	143 ms	75000 KB	Output is correct
68	Correct	118 ms	86264 KB	Output is correct
69	Correct	117 ms	90076 KB	Output is correct
70	Correct	116 ms	82400 KB	Output is correct
71	Correct	115 ms	99064 KB	Output is correct
72	Correct	94 ms	97400 KB	Output is correct
73	Correct	12 ms	7680 KB	Output is correct

Submission #98407

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 55.0 / 55.0

Subtask #3 15.0 / 15.0

Subtask #4 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
55.0 / 55.0

Subtask #3
15.0 / 15.0

Subtask #4
25.0 / 25.0