Submission #372629

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
372629	2021-03-01T07:32:12 Z	alishahali1382	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	100 / 100	452 ms	780564 KB

joi2019_ho_t3

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define SZ(x) ((int)(x).size())

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int N=405;

int n, m, k, u, v, x, y, t, a, b, ans;
int dp[N][N][N][3], cnt[N][3];
vector<int> R, G, Y;
string S;

inline void upd(int &x, int y){ if (x>y) x=y;}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>S;
	for (int i=1; i<=n; i++){
		memcpy(cnt[i], cnt[i-1], sizeof(cnt[i]));
		if (S[i-1]=='R') R.pb(i), cnt[i][0]++;
		if (S[i-1]=='G') G.pb(i), cnt[i][1]++;
		if (S[i-1]=='Y') Y.pb(i), cnt[i][2]++;
	}
	memset(dp, 63, sizeof(dp));
	dp[0][0][0][0]=dp[0][0][0][1]=dp[0][0][0][2]=0;
	for (int r=0; r<=SZ(R); r++) for (int g=0; g<=SZ(G); g++) for (int y=0; y<=SZ(Y); y++){
		if (r<SZ(R)){
			int cost=max(0, cnt[R[r]][1]-g)+max(0, cnt[R[r]][2]-y);
			upd(dp[r+1][g][y][0], min(dp[r][g][y][1], dp[r][g][y][2])+cost);
		}
		if (g<SZ(G)){
			int cost=max(0, cnt[G[g]][0]-r)+max(0, cnt[G[g]][2]-y);
			upd(dp[r][g+1][y][1], min(dp[r][g][y][0], dp[r][g][y][2])+cost);
		}
		if (y<SZ(Y)){
			int cost=max(0, cnt[Y[y]][0]-r)+max(0, cnt[Y[y]][1]-g);
			upd(dp[r][g][y+1][2], min(dp[r][g][y][0], dp[r][g][y][1])+cost);
		}
	}
	ans=inf;
	for (int i:{0, 1, 2}) upd(ans, dp[SZ(R)][SZ(G)][SZ(Y)][i]);
	if (ans==inf) ans=-1;
	cout<<ans<<"\n";
	
	return 0;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	414 ms	780524 KB	Output is correct
2	Correct	406 ms	780324 KB	Output is correct
3	Correct	410 ms	780524 KB	Output is correct
4	Correct	412 ms	780564 KB	Output is correct
5	Correct	411 ms	780388 KB	Output is correct
6	Correct	408 ms	780232 KB	Output is correct
7	Correct	406 ms	780416 KB	Output is correct
8	Correct	420 ms	780396 KB	Output is correct
9	Correct	412 ms	780396 KB	Output is correct
10	Correct	412 ms	780396 KB	Output is correct
11	Correct	431 ms	780396 KB	Output is correct
12	Correct	416 ms	780396 KB	Output is correct
13	Correct	417 ms	780288 KB	Output is correct
14	Correct	412 ms	780284 KB	Output is correct
15	Correct	408 ms	780396 KB	Output is correct
16	Correct	408 ms	780328 KB	Output is correct
17	Correct	403 ms	780396 KB	Output is correct

Subtask #2
55.0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	414 ms	780524 KB	Output is correct
2	Correct	406 ms	780324 KB	Output is correct
3	Correct	410 ms	780524 KB	Output is correct
4	Correct	412 ms	780564 KB	Output is correct
5	Correct	411 ms	780388 KB	Output is correct
6	Correct	408 ms	780232 KB	Output is correct
7	Correct	406 ms	780416 KB	Output is correct
8	Correct	420 ms	780396 KB	Output is correct
9	Correct	412 ms	780396 KB	Output is correct
10	Correct	412 ms	780396 KB	Output is correct
11	Correct	431 ms	780396 KB	Output is correct
12	Correct	416 ms	780396 KB	Output is correct
13	Correct	417 ms	780288 KB	Output is correct
14	Correct	412 ms	780284 KB	Output is correct
15	Correct	408 ms	780396 KB	Output is correct
16	Correct	408 ms	780328 KB	Output is correct
17	Correct	403 ms	780396 KB	Output is correct
18	Correct	409 ms	780396 KB	Output is correct
19	Correct	407 ms	780396 KB	Output is correct
20	Correct	409 ms	780412 KB	Output is correct
21	Correct	406 ms	780396 KB	Output is correct
22	Correct	412 ms	780524 KB	Output is correct
23	Correct	417 ms	780396 KB	Output is correct
24	Correct	408 ms	780396 KB	Output is correct
25	Correct	435 ms	780396 KB	Output is correct
26	Correct	409 ms	780524 KB	Output is correct
27	Correct	411 ms	780396 KB	Output is correct
28	Correct	410 ms	780396 KB	Output is correct
29	Correct	416 ms	780524 KB	Output is correct
30	Correct	417 ms	780396 KB	Output is correct
31	Correct	410 ms	780396 KB	Output is correct
32	Correct	417 ms	780396 KB	Output is correct
33	Correct	411 ms	780396 KB	Output is correct
34	Correct	415 ms	780396 KB	Output is correct
35	Correct	409 ms	780396 KB	Output is correct
36	Correct	412 ms	780396 KB	Output is correct
37	Correct	409 ms	780396 KB	Output is correct
38	Correct	409 ms	780396 KB	Output is correct
39	Correct	409 ms	780396 KB	Output is correct
40	Correct	406 ms	780396 KB	Output is correct
41	Correct	413 ms	780396 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	411 ms	780396 KB	Output is correct
2	Correct	409 ms	780460 KB	Output is correct
3	Correct	408 ms	780396 KB	Output is correct
4	Correct	412 ms	780396 KB	Output is correct
5	Correct	407 ms	780364 KB	Output is correct
6	Correct	409 ms	780396 KB	Output is correct
7	Correct	415 ms	780496 KB	Output is correct
8	Correct	406 ms	780396 KB	Output is correct
9	Correct	411 ms	780416 KB	Output is correct
10	Correct	407 ms	780396 KB	Output is correct
11	Correct	411 ms	780416 KB	Output is correct
12	Correct	409 ms	780396 KB	Output is correct
13	Correct	411 ms	780524 KB	Output is correct
14	Correct	409 ms	780396 KB	Output is correct
15	Correct	408 ms	780524 KB	Output is correct
16	Correct	406 ms	780524 KB	Output is correct

Subtask #4
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	414 ms	780524 KB	Output is correct
2	Correct	406 ms	780324 KB	Output is correct
3	Correct	410 ms	780524 KB	Output is correct
4	Correct	412 ms	780564 KB	Output is correct
5	Correct	411 ms	780388 KB	Output is correct
6	Correct	408 ms	780232 KB	Output is correct
7	Correct	406 ms	780416 KB	Output is correct
8	Correct	420 ms	780396 KB	Output is correct
9	Correct	412 ms	780396 KB	Output is correct
10	Correct	412 ms	780396 KB	Output is correct
11	Correct	431 ms	780396 KB	Output is correct
12	Correct	416 ms	780396 KB	Output is correct
13	Correct	417 ms	780288 KB	Output is correct
14	Correct	412 ms	780284 KB	Output is correct
15	Correct	408 ms	780396 KB	Output is correct
16	Correct	408 ms	780328 KB	Output is correct
17	Correct	403 ms	780396 KB	Output is correct
18	Correct	409 ms	780396 KB	Output is correct
19	Correct	407 ms	780396 KB	Output is correct
20	Correct	409 ms	780412 KB	Output is correct
21	Correct	406 ms	780396 KB	Output is correct
22	Correct	412 ms	780524 KB	Output is correct
23	Correct	417 ms	780396 KB	Output is correct
24	Correct	408 ms	780396 KB	Output is correct
25	Correct	435 ms	780396 KB	Output is correct
26	Correct	409 ms	780524 KB	Output is correct
27	Correct	411 ms	780396 KB	Output is correct
28	Correct	410 ms	780396 KB	Output is correct
29	Correct	416 ms	780524 KB	Output is correct
30	Correct	417 ms	780396 KB	Output is correct
31	Correct	410 ms	780396 KB	Output is correct
32	Correct	417 ms	780396 KB	Output is correct
33	Correct	411 ms	780396 KB	Output is correct
34	Correct	415 ms	780396 KB	Output is correct
35	Correct	409 ms	780396 KB	Output is correct
36	Correct	412 ms	780396 KB	Output is correct
37	Correct	409 ms	780396 KB	Output is correct
38	Correct	409 ms	780396 KB	Output is correct
39	Correct	409 ms	780396 KB	Output is correct
40	Correct	406 ms	780396 KB	Output is correct
41	Correct	413 ms	780396 KB	Output is correct
42	Correct	411 ms	780396 KB	Output is correct
43	Correct	409 ms	780460 KB	Output is correct
44	Correct	408 ms	780396 KB	Output is correct
45	Correct	412 ms	780396 KB	Output is correct
46	Correct	407 ms	780364 KB	Output is correct
47	Correct	409 ms	780396 KB	Output is correct
48	Correct	415 ms	780496 KB	Output is correct
49	Correct	406 ms	780396 KB	Output is correct
50	Correct	411 ms	780416 KB	Output is correct
51	Correct	407 ms	780396 KB	Output is correct
52	Correct	411 ms	780416 KB	Output is correct
53	Correct	409 ms	780396 KB	Output is correct
54	Correct	411 ms	780524 KB	Output is correct
55	Correct	409 ms	780396 KB	Output is correct
56	Correct	408 ms	780524 KB	Output is correct
57	Correct	406 ms	780524 KB	Output is correct
58	Correct	432 ms	780396 KB	Output is correct
59	Correct	437 ms	780448 KB	Output is correct
60	Correct	431 ms	780396 KB	Output is correct
61	Correct	438 ms	780396 KB	Output is correct
62	Correct	419 ms	780396 KB	Output is correct
63	Correct	418 ms	780368 KB	Output is correct
64	Correct	423 ms	780524 KB	Output is correct
65	Correct	428 ms	780504 KB	Output is correct
66	Correct	452 ms	780344 KB	Output is correct
67	Correct	441 ms	780308 KB	Output is correct
68	Correct	434 ms	780396 KB	Output is correct
69	Correct	438 ms	780396 KB	Output is correct
70	Correct	439 ms	780396 KB	Output is correct
71	Correct	437 ms	780396 KB	Output is correct
72	Correct	416 ms	780396 KB	Output is correct
73	Correct	409 ms	780304 KB	Output is correct

Submission #372629

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