Submission #376990

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
376990	2021-03-12T15:24:34 Z	peijar	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	100 / 100	481 ms	757740 KB

joi2019_ho_t3

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;

const int MAXN = 401;
const int INF = 1e9;

int dp[MAXN][MAXN][MAXN][3];

signed main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	int nbFleurs;
	string fleurs;
	cin >> nbFleurs >> fleurs;
	vector<vector<int>> positions(3);
	vector<vector<int>> prefixSum(3, vector<int>(nbFleurs+1));
	for (int i(0); i < nbFleurs; ++i)
	{
		if (fleurs[i] == 'R')
			positions[0].push_back(i);
		else if (fleurs[i] == 'G')
			positions[1].push_back(i);
		else
			positions[2].push_back(i);
		for (int j(0); j < 3; ++j)
			prefixSum[j][i+1] = (int)positions[j].size();
	}
	for (int nbRouge(0); nbRouge <= nbFleurs; ++nbRouge)
		for (int nbVerts(0); nbVerts <= nbFleurs; ++nbVerts)
			for (int nbJaunes(0); nbJaunes <= nbFleurs; ++nbJaunes)
				for (int dernier(0); dernier < 3; ++dernier)
					dp[nbRouge][nbVerts][nbJaunes][dernier]= INF;
	int rep = INF;
	int totRouges = (int)positions[0].size();
	int totVerts = (int)positions[1].size();
	int totJaunes = (int)positions[2].size();
	for (int i(0); i < 3; ++i)
		positions[i].push_back(nbFleurs);
	if (totRouges)
		dp[1][0][0][0] = positions[0][0];
	if (totVerts)
		dp[0][1][0][1] = positions[1][0];
	if (totJaunes)
		dp[0][0][1][2] = positions[2][0];
	for (int nbRouges(0); nbRouges <= totRouges; ++nbRouges)
		for (int nbVerts(0); nbVerts <= totVerts; ++nbVerts)
			for (int nbJaunes(0); nbJaunes <= totJaunes ; ++nbJaunes)
			{
				auto &x = dp[nbRouges][nbVerts][nbJaunes];
				int swapRouge(0), swapVerts(0), swapJaunes(0);
				int posRouge = positions[0][nbRouges];
				int posVert = positions[1][nbVerts];
				int posJaune = positions[2][nbJaunes];
				int prevPosRouge=0;
				int prevPosVert=0;
				int prevPosJaune=0;
				if (nbRouges)
				{
					prevPosRouge=positions[0][nbRouges-1];
					if (prevPosRouge > posVert)
						swapRouge += prefixSum[1][prevPosRouge] - prefixSum[1][posVert];
					if (prevPosRouge > posJaune)
						swapRouge += prefixSum[2][prevPosRouge] - prefixSum[2][posJaune];
					int bst = min(dp[nbRouges-1][nbVerts][nbJaunes][1],
							dp[nbRouges-1][nbVerts][nbJaunes][2]);
					if (bst < INF)
						x[0] = bst + swapRouge;
				}
				if (nbVerts)
				{
					prevPosVert = positions[1][nbVerts-1];
					if (prevPosVert > posRouge)
						swapVerts += prefixSum[0][prevPosVert] - prefixSum[0][posRouge];
					if (prevPosVert> posJaune)
						swapVerts += prefixSum[2][prevPosVert] - prefixSum[2][posJaune];
					int bst = min(dp[nbRouges][nbVerts-1][nbJaunes][0],
							dp[nbRouges][nbVerts-1][nbJaunes][2]);
					if (bst < INF)
						x[1] = bst + swapVerts;
				}
				if (nbJaunes)
				{
					prevPosJaune = positions[2][nbJaunes-1];
					if (prevPosJaune > posRouge)
						swapJaunes += prefixSum[0][prevPosJaune] - prefixSum[0][posRouge];
					if (prevPosJaune > posVert)
						swapJaunes += prefixSum[1][prevPosJaune] - prefixSum[1][posVert];
					int bst = min(dp[nbRouges][nbVerts][nbJaunes-1][0],
							dp[nbRouges][nbVerts][nbJaunes-1][1]);
					if (bst < INF)
						x[2] = bst + swapJaunes;
				}
			}
	for (int dernier(0); dernier < 3; ++dernier)
		rep = min(rep, dp[totRouges][totVerts][totJaunes][dernier]);

	if (rep == INF)
		rep = -1;
	cout << rep << endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
55.0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	876 KB	Output is correct
5	Correct	1 ms	1516 KB	Output is correct
6	Correct	1 ms	1516 KB	Output is correct
7	Correct	2 ms	1516 KB	Output is correct
8	Correct	1 ms	1516 KB	Output is correct
9	Correct	1 ms	1516 KB	Output is correct
10	Correct	1 ms	1516 KB	Output is correct
11	Correct	1 ms	1516 KB	Output is correct
12	Correct	1 ms	1516 KB	Output is correct
13	Correct	1 ms	1516 KB	Output is correct
14	Correct	1 ms	1388 KB	Output is correct
15	Correct	1 ms	1516 KB	Output is correct
16	Correct	1 ms	1516 KB	Output is correct
17	Correct	1 ms	1388 KB	Output is correct
18	Correct	10 ms	18028 KB	Output is correct
19	Correct	10 ms	18028 KB	Output is correct
20	Correct	10 ms	18028 KB	Output is correct
21	Correct	10 ms	18028 KB	Output is correct
22	Correct	10 ms	18028 KB	Output is correct
23	Correct	10 ms	18028 KB	Output is correct
24	Correct	10 ms	18028 KB	Output is correct
25	Correct	10 ms	18028 KB	Output is correct
26	Correct	10 ms	18028 KB	Output is correct
27	Correct	10 ms	18028 KB	Output is correct
28	Correct	10 ms	18028 KB	Output is correct
29	Correct	10 ms	18048 KB	Output is correct
30	Correct	10 ms	18028 KB	Output is correct
31	Correct	10 ms	18028 KB	Output is correct
32	Correct	10 ms	18028 KB	Output is correct
33	Correct	10 ms	17516 KB	Output is correct
34	Correct	10 ms	17516 KB	Output is correct
35	Correct	10 ms	16876 KB	Output is correct
36	Correct	10 ms	17516 KB	Output is correct
37	Correct	11 ms	16256 KB	Output is correct
38	Correct	10 ms	18028 KB	Output is correct
39	Correct	10 ms	18028 KB	Output is correct
40	Correct	9 ms	17516 KB	Output is correct
41	Correct	10 ms	18028 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	409 ms	757484 KB	Output is correct
3	Correct	400 ms	755308 KB	Output is correct
4	Correct	408 ms	757740 KB	Output is correct
5	Correct	408 ms	757484 KB	Output is correct
6	Correct	405 ms	757484 KB	Output is correct
7	Correct	406 ms	755308 KB	Output is correct
8	Correct	405 ms	755436 KB	Output is correct
9	Correct	403 ms	751596 KB	Output is correct
10	Correct	405 ms	757612 KB	Output is correct
11	Correct	406 ms	757612 KB	Output is correct
12	Correct	111 ms	202860 KB	Output is correct
13	Correct	192 ms	357468 KB	Output is correct
14	Correct	275 ms	517484 KB	Output is correct
15	Correct	401 ms	757484 KB	Output is correct
16	Correct	407 ms	757612 KB	Output is correct

Subtask #4
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	876 KB	Output is correct
5	Correct	1 ms	1516 KB	Output is correct
6	Correct	1 ms	1516 KB	Output is correct
7	Correct	2 ms	1516 KB	Output is correct
8	Correct	1 ms	1516 KB	Output is correct
9	Correct	1 ms	1516 KB	Output is correct
10	Correct	1 ms	1516 KB	Output is correct
11	Correct	1 ms	1516 KB	Output is correct
12	Correct	1 ms	1516 KB	Output is correct
13	Correct	1 ms	1516 KB	Output is correct
14	Correct	1 ms	1388 KB	Output is correct
15	Correct	1 ms	1516 KB	Output is correct
16	Correct	1 ms	1516 KB	Output is correct
17	Correct	1 ms	1388 KB	Output is correct
18	Correct	10 ms	18028 KB	Output is correct
19	Correct	10 ms	18028 KB	Output is correct
20	Correct	10 ms	18028 KB	Output is correct
21	Correct	10 ms	18028 KB	Output is correct
22	Correct	10 ms	18028 KB	Output is correct
23	Correct	10 ms	18028 KB	Output is correct
24	Correct	10 ms	18028 KB	Output is correct
25	Correct	10 ms	18028 KB	Output is correct
26	Correct	10 ms	18028 KB	Output is correct
27	Correct	10 ms	18028 KB	Output is correct
28	Correct	10 ms	18028 KB	Output is correct
29	Correct	10 ms	18048 KB	Output is correct
30	Correct	10 ms	18028 KB	Output is correct
31	Correct	10 ms	18028 KB	Output is correct
32	Correct	10 ms	18028 KB	Output is correct
33	Correct	10 ms	17516 KB	Output is correct
34	Correct	10 ms	17516 KB	Output is correct
35	Correct	10 ms	16876 KB	Output is correct
36	Correct	10 ms	17516 KB	Output is correct
37	Correct	11 ms	16256 KB	Output is correct
38	Correct	10 ms	18028 KB	Output is correct
39	Correct	10 ms	18028 KB	Output is correct
40	Correct	9 ms	17516 KB	Output is correct
41	Correct	10 ms	18028 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	409 ms	757484 KB	Output is correct
44	Correct	400 ms	755308 KB	Output is correct
45	Correct	408 ms	757740 KB	Output is correct
46	Correct	408 ms	757484 KB	Output is correct
47	Correct	405 ms	757484 KB	Output is correct
48	Correct	406 ms	755308 KB	Output is correct
49	Correct	405 ms	755436 KB	Output is correct
50	Correct	403 ms	751596 KB	Output is correct
51	Correct	405 ms	757612 KB	Output is correct
52	Correct	406 ms	757612 KB	Output is correct
53	Correct	111 ms	202860 KB	Output is correct
54	Correct	192 ms	357468 KB	Output is correct
55	Correct	275 ms	517484 KB	Output is correct
56	Correct	401 ms	757484 KB	Output is correct
57	Correct	407 ms	757612 KB	Output is correct
58	Correct	473 ms	757604 KB	Output is correct
59	Correct	481 ms	757612 KB	Output is correct
60	Correct	470 ms	751468 KB	Output is correct
61	Correct	477 ms	755308 KB	Output is correct
62	Correct	408 ms	757484 KB	Output is correct
63	Correct	410 ms	757408 KB	Output is correct
64	Correct	441 ms	757740 KB	Output is correct
65	Correct	459 ms	755308 KB	Output is correct
66	Correct	471 ms	747760 KB	Output is correct
67	Correct	472 ms	757484 KB	Output is correct
68	Correct	468 ms	755308 KB	Output is correct
69	Correct	476 ms	757484 KB	Output is correct
70	Correct	479 ms	757484 KB	Output is correct
71	Correct	474 ms	755308 KB	Output is correct
72	Correct	427 ms	755304 KB	Output is correct
73	Correct	403 ms	757484 KB	Output is correct

Submission #376990

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