Submission #960273

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
960273	2024-04-10T06:25:11 Z	LCJLY	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	100 / 100	75 ms	8436 KB

joi2019_ho_t3

#include <bits/stdc++.h>
using namespace std;	
 
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,int>pii;
//typedef pair<pii,pii>pi2;
typedef array<int,6>pi2;

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n;
string s;
vector<int>v[3];
int arr[401];
int memo2[3][401];
int dp[2][401][401][3];

int f(int color, int pos){
	if(memo2[color][pos]!=-1) return memo2[color][pos];
	int hold=lower_bound(v[color].begin(),v[color].end(),pos)-v[color].begin();
	return memo2[color][pos]=hold;	
}

int add(int a, int b){
	return  max(0LL,a+b);	
}

void solve(){
	cin >> n >> s;
	
	for(int x=0;x<n;x++){
		if(s[x]=='R'){
			arr[x]=0;
		}
		else if(s[x]=='G'){
			arr[x]=1;
		}
		else arr[x]=2;
		v[arr[x]].push_back(x);
	}
	
	memset(memo2,-1,sizeof(memo2));
	
	//iterative
	for(int x=0;x<401;x++){
		for(int y=0;y<401;y++){
			for(int i=0;i<3;i++){
				dp[0][x][y][i]=1e15;
				dp[1][x][y][i]=1e15;
			}
		}
	}
	
	dp[0][0][0][0]=0;
	dp[0][0][0][1]=0;
	dp[0][0][0][2]=0;
	
	int ans=1e15;
	
	for(int r=0;r<=(int)v[0].size();r++){
		for(int g=0;g<=(int)v[1].size();g++){
			for(int b=0;b<=(int)v[2].size();b++){
				for(int last=0;last<3;last++){
					int index=r+g+b;
					
					if(index==0){
						if(r<(int)v[0].size())dp[1][g][b][0]=min(dp[1][g][b][0],dp[0][g][b][last]+v[0][r]);
						
						if(g<(int)v[1].size())dp[0][g+1][b][1]=min(dp[0][g+1][b][1],dp[0][g][b][last]+v[1][g]);
						
						if(g<(int)v[2].size())dp[0][g][b+1][2]=min(dp[0][g][b+1][2],dp[0][g][b][last]+v[2][b]);
					}	
					else{
						if(r<(int)v[0].size() && last!=0){
							int hold=f(1,v[0][r]);
							int hold2=f(2,v[0][r]);
							
							int cost=add(hold,-g)+add(hold2,-b);
							
							dp[1][g][b][0]=min(dp[1][g][b][0],dp[0][g][b][last]+cost);
						}
						
						if(g<(int)v[1].size() && last!=1){
							int hold=f(0,v[1][g]);
							int hold2=f(2,v[1][g]);
							
							int cost=add(hold,-r)+add(hold2,-b);
							
							dp[0][g+1][b][1]=min(dp[0][g+1][b][1],dp[0][g][b][last]+cost);
						}
						
						if(b<(int)v[2].size() && last!=2){
							int hold=f(0,v[2][b]);
							int hold2=f(1,v[2][b]);
							
							int cost=add(hold,-r)+add(hold2,-g);
							
							dp[0][g][b+1][2]=min(dp[0][g][b+1][2],dp[0][g][b][last]+cost);
						}
					}
				}
			}
		}
		
		for(int g=0;g<=(int)v[1].size();g++){
			for(int b=0;b<=(int)v[2].size();b++){
				for(int last=0;last<3;last++){
					//show(r,r);
					//show3(g,g,b,b,last,last);
					//show(dp[1][g][b][last],dp[1][g][b][last]);
					if(r+g+b==n){
						ans=min(ans,dp[0][g][b][last]);
					}
					dp[0][g][b][last]=dp[1][g][b][last];
					dp[1][g][b][last]=1e15;
				}
			}
		}
	}

	if(ans>=1e12){
		cout << -1;
	}
	else cout << ans;
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	7772 KB	Output is correct
2	Correct	2 ms	7772 KB	Output is correct
3	Correct	3 ms	7772 KB	Output is correct
4	Correct	3 ms	7772 KB	Output is correct
5	Correct	2 ms	7824 KB	Output is correct
6	Correct	2 ms	7772 KB	Output is correct
7	Correct	2 ms	7832 KB	Output is correct
8	Correct	2 ms	7772 KB	Output is correct
9	Correct	3 ms	7772 KB	Output is correct
10	Correct	2 ms	7772 KB	Output is correct
11	Correct	2 ms	8028 KB	Output is correct
12	Correct	2 ms	7772 KB	Output is correct
13	Correct	2 ms	8028 KB	Output is correct
14	Correct	2 ms	7772 KB	Output is correct
15	Correct	2 ms	7772 KB	Output is correct
16	Correct	2 ms	7772 KB	Output is correct
17	Correct	2 ms	7768 KB	Output is correct

Subtask #2
55.0 / 55.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	7772 KB	Output is correct
2	Correct	2 ms	7772 KB	Output is correct
3	Correct	3 ms	7772 KB	Output is correct
4	Correct	3 ms	7772 KB	Output is correct
5	Correct	2 ms	7824 KB	Output is correct
6	Correct	2 ms	7772 KB	Output is correct
7	Correct	2 ms	7832 KB	Output is correct
8	Correct	2 ms	7772 KB	Output is correct
9	Correct	3 ms	7772 KB	Output is correct
10	Correct	2 ms	7772 KB	Output is correct
11	Correct	2 ms	8028 KB	Output is correct
12	Correct	2 ms	7772 KB	Output is correct
13	Correct	2 ms	8028 KB	Output is correct
14	Correct	2 ms	7772 KB	Output is correct
15	Correct	2 ms	7772 KB	Output is correct
16	Correct	2 ms	7772 KB	Output is correct
17	Correct	2 ms	7768 KB	Output is correct
18	Correct	2 ms	7768 KB	Output is correct
19	Correct	2 ms	7768 KB	Output is correct
20	Correct	3 ms	7772 KB	Output is correct
21	Correct	2 ms	7772 KB	Output is correct
22	Correct	2 ms	7772 KB	Output is correct
23	Correct	2 ms	7772 KB	Output is correct
24	Correct	2 ms	8028 KB	Output is correct
25	Correct	2 ms	7772 KB	Output is correct
26	Correct	3 ms	7768 KB	Output is correct
27	Correct	2 ms	7772 KB	Output is correct
28	Correct	2 ms	8028 KB	Output is correct
29	Correct	2 ms	8028 KB	Output is correct
30	Correct	2 ms	7772 KB	Output is correct
31	Correct	2 ms	7772 KB	Output is correct
32	Correct	2 ms	7772 KB	Output is correct
33	Correct	2 ms	8028 KB	Output is correct
34	Correct	2 ms	7772 KB	Output is correct
35	Correct	2 ms	7768 KB	Output is correct
36	Correct	2 ms	8028 KB	Output is correct
37	Correct	2 ms	7772 KB	Output is correct
38	Correct	2 ms	8028 KB	Output is correct
39	Correct	2 ms	7772 KB	Output is correct
40	Correct	2 ms	7772 KB	Output is correct
41	Correct	2 ms	7772 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	7768 KB	Output is correct
2	Correct	3 ms	8288 KB	Output is correct
3	Correct	3 ms	7888 KB	Output is correct
4	Correct	3 ms	8028 KB	Output is correct
5	Correct	4 ms	8028 KB	Output is correct
6	Correct	4 ms	8028 KB	Output is correct
7	Correct	3 ms	8028 KB	Output is correct
8	Correct	3 ms	8028 KB	Output is correct
9	Correct	3 ms	8028 KB	Output is correct
10	Correct	4 ms	7896 KB	Output is correct
11	Correct	3 ms	8024 KB	Output is correct
12	Correct	2 ms	8028 KB	Output is correct
13	Correct	3 ms	8436 KB	Output is correct
14	Correct	3 ms	8028 KB	Output is correct
15	Correct	3 ms	8028 KB	Output is correct
16	Correct	3 ms	8024 KB	Output is correct

Subtask #4
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	7772 KB	Output is correct
2	Correct	2 ms	7772 KB	Output is correct
3	Correct	3 ms	7772 KB	Output is correct
4	Correct	3 ms	7772 KB	Output is correct
5	Correct	2 ms	7824 KB	Output is correct
6	Correct	2 ms	7772 KB	Output is correct
7	Correct	2 ms	7832 KB	Output is correct
8	Correct	2 ms	7772 KB	Output is correct
9	Correct	3 ms	7772 KB	Output is correct
10	Correct	2 ms	7772 KB	Output is correct
11	Correct	2 ms	8028 KB	Output is correct
12	Correct	2 ms	7772 KB	Output is correct
13	Correct	2 ms	8028 KB	Output is correct
14	Correct	2 ms	7772 KB	Output is correct
15	Correct	2 ms	7772 KB	Output is correct
16	Correct	2 ms	7772 KB	Output is correct
17	Correct	2 ms	7768 KB	Output is correct
18	Correct	2 ms	7768 KB	Output is correct
19	Correct	2 ms	7768 KB	Output is correct
20	Correct	3 ms	7772 KB	Output is correct
21	Correct	2 ms	7772 KB	Output is correct
22	Correct	2 ms	7772 KB	Output is correct
23	Correct	2 ms	7772 KB	Output is correct
24	Correct	2 ms	8028 KB	Output is correct
25	Correct	2 ms	7772 KB	Output is correct
26	Correct	3 ms	7768 KB	Output is correct
27	Correct	2 ms	7772 KB	Output is correct
28	Correct	2 ms	8028 KB	Output is correct
29	Correct	2 ms	8028 KB	Output is correct
30	Correct	2 ms	7772 KB	Output is correct
31	Correct	2 ms	7772 KB	Output is correct
32	Correct	2 ms	7772 KB	Output is correct
33	Correct	2 ms	8028 KB	Output is correct
34	Correct	2 ms	7772 KB	Output is correct
35	Correct	2 ms	7768 KB	Output is correct
36	Correct	2 ms	8028 KB	Output is correct
37	Correct	2 ms	7772 KB	Output is correct
38	Correct	2 ms	8028 KB	Output is correct
39	Correct	2 ms	7772 KB	Output is correct
40	Correct	2 ms	7772 KB	Output is correct
41	Correct	2 ms	7772 KB	Output is correct
42	Correct	2 ms	7768 KB	Output is correct
43	Correct	3 ms	8288 KB	Output is correct
44	Correct	3 ms	7888 KB	Output is correct
45	Correct	3 ms	8028 KB	Output is correct
46	Correct	4 ms	8028 KB	Output is correct
47	Correct	4 ms	8028 KB	Output is correct
48	Correct	3 ms	8028 KB	Output is correct
49	Correct	3 ms	8028 KB	Output is correct
50	Correct	3 ms	8028 KB	Output is correct
51	Correct	4 ms	7896 KB	Output is correct
52	Correct	3 ms	8024 KB	Output is correct
53	Correct	2 ms	8028 KB	Output is correct
54	Correct	3 ms	8436 KB	Output is correct
55	Correct	3 ms	8028 KB	Output is correct
56	Correct	3 ms	8028 KB	Output is correct
57	Correct	3 ms	8024 KB	Output is correct
58	Correct	72 ms	8184 KB	Output is correct
59	Correct	75 ms	8028 KB	Output is correct
60	Correct	68 ms	8028 KB	Output is correct
61	Correct	69 ms	8024 KB	Output is correct
62	Correct	8 ms	8028 KB	Output is correct
63	Correct	12 ms	7860 KB	Output is correct
64	Correct	37 ms	8028 KB	Output is correct
65	Correct	51 ms	8028 KB	Output is correct
66	Correct	67 ms	8028 KB	Output is correct
67	Correct	71 ms	8028 KB	Output is correct
68	Correct	68 ms	8024 KB	Output is correct
69	Correct	75 ms	8024 KB	Output is correct
70	Correct	68 ms	7772 KB	Output is correct
71	Correct	73 ms	8028 KB	Output is correct
72	Correct	18 ms	8024 KB	Output is correct
73	Correct	6 ms	8028 KB	Output is correct

Submission #960273

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