oj.uz

Submission #1113609

# Submission time Handle Problem Language Result Execution time Memory
1113609 2024-11-16T19:41:12 Z Dan4Life Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 365 ms 387120 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
 
using vi = vector<int>;
using ll = long long;
using ar2 = array<ll,2>;
 
const int N = (int)4e2+2;
const int INF = (int)1e9;
const ll LINF = (ll)2e18;
 
vi v[3];
string s;
int n, cnt[3];
int dp[N][3][N/2][N];
int chk[3][3][N][N];

int num(int cnt0, int cnt1, int cnt2, int f0, int f1, int f2){
	return chk[f0][f1][cnt0][cnt1]+chk[f0][f2][cnt0][cnt2];
}
 
void swp(int i, int j){
	swap(cnt[i],cnt[j]); swap(v[i],v[j]);
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> s;
	for(int i = 0; i < n; i++){
		char u = s[i];
		if(u=='R') s[i]=0;
		else if(u=='G') s[i]=1;
		else s[i]=2;
		cnt[s[i]]++; v[s[i]].pb(i+1);
	}
	if(cnt[0]>cnt[1])swp(0,1);
	if(cnt[1]>cnt[2])swp(1,2);
	if(cnt[0]>cnt[1])swp(0,1);
	memset(dp,0x3f3f3f3f,sizeof(dp));
	if(cnt[0]) dp[1][0][1][0] = v[0][0]-1;
	if(cnt[1]) dp[1][1][0][1] = v[1][0]-1;
	if(cnt[2]) dp[1][2][0][0] = v[2][0]-1;
	for(int f0 = 0; f0 < 3; f0++){
		for(int f1 = 0; f1 < 3; f1++){
			if(f0==f1) continue;
			for(int cnt0 = 1; cnt0 <= cnt[f0]; cnt0++){
				for(int cnt1 = 0; cnt1 <= cnt[f1]; cnt1++){
					int pos = lower_bound(all(v[f1]),v[f0][cnt0-1])-begin(v[f1]);
					chk[f0][f1][cnt0][cnt1] = max(0,cnt1-pos);
				}
			}
		}
	}
	int ans = INF;
	for(int i = 2; i <= n; i++){
		for(int j = 0; j < 3; j++){
			for(int m = 0; m < 3; m++){
				if(m==j) continue;
				for(int k = 0; k <= min(i,cnt[0]); k++){
					for(int l = 0; l <= min(i,cnt[1]); l++){
						int o = i-k-l; if(o>i or o>cnt[2]) continue;
						if(k and j==0){
							int f0 = v[0][k-1]+num(k,l,o,0,1,2);
							if(f0>=i) dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-1][m][k-1][l]+f0-i);
						}
						if(l and j==1){
							int f1 = v[1][l-1]+num(l,k,o,1,0,2);
							if(f1>=i) dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-1][m][k][l-1]+f1-i);
						}
						if(o and j==2){
							int f2 = v[2][o-1]+num(o,k,l,2,0,1);
							if(f2>=i) dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-1][m][k][l]+f2-i);
						}
					}
				}
			}
		}
	}
	for(int j = 0; j < 3; j++)
		for(int k = 0; k <= cnt[0]; k++)
			for(int l = 0; l <= cnt[1]; l++)
				ans = min(ans, dp[n][j][k][l]);
	if(ans>=INF) ans=-1;
	cout << ans << "\n";
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:38:11: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |   cnt[s[i]]++; v[s[i]].pb(i+1);
      |           ^
joi2019_ho_t3.cpp:38:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |   cnt[s[i]]++; v[s[i]].pb(i+1);
      |                      ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 383048 KB Output is correct
2 Correct 251 ms 383052 KB Output is correct
3 Correct 269 ms 383120 KB Output is correct
4 Correct 269 ms 383048 KB Output is correct
5 Correct 262 ms 383304 KB Output is correct
6 Correct 269 ms 383136 KB Output is correct
7 Correct 271 ms 383304 KB Output is correct
8 Correct 277 ms 383300 KB Output is correct
9 Correct 251 ms 383308 KB Output is correct
10 Correct 270 ms 383304 KB Output is correct
11 Correct 276 ms 383304 KB Output is correct
12 Correct 279 ms 383084 KB Output is correct
13 Correct 261 ms 383304 KB Output is correct
14 Correct 273 ms 383304 KB Output is correct
15 Correct 264 ms 387120 KB Output is correct
16 Correct 246 ms 383048 KB Output is correct
17 Correct 273 ms 383288 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 383048 KB Output is correct
2 Correct 251 ms 383052 KB Output is correct
3 Correct 269 ms 383120 KB Output is correct
4 Correct 269 ms 383048 KB Output is correct
5 Correct 262 ms 383304 KB Output is correct
6 Correct 269 ms 383136 KB Output is correct
7 Correct 271 ms 383304 KB Output is correct
8 Correct 277 ms 383300 KB Output is correct
9 Correct 251 ms 383308 KB Output is correct
10 Correct 270 ms 383304 KB Output is correct
11 Correct 276 ms 383304 KB Output is correct
12 Correct 279 ms 383084 KB Output is correct
13 Correct 261 ms 383304 KB Output is correct
14 Correct 273 ms 383304 KB Output is correct
15 Correct 264 ms 387120 KB Output is correct
16 Correct 246 ms 383048 KB Output is correct
17 Correct 273 ms 383288 KB Output is correct
18 Correct 259 ms 383340 KB Output is correct
19 Correct 276 ms 383304 KB Output is correct
20 Correct 259 ms 383412 KB Output is correct
21 Correct 230 ms 383304 KB Output is correct
22 Correct 232 ms 383292 KB Output is correct
23 Correct 246 ms 383260 KB Output is correct
24 Correct 233 ms 383372 KB Output is correct
25 Correct 230 ms 383324 KB Output is correct
26 Correct 233 ms 383240 KB Output is correct
27 Correct 249 ms 383304 KB Output is correct
28 Correct 245 ms 383452 KB Output is correct
29 Correct 271 ms 383392 KB Output is correct
30 Correct 267 ms 383304 KB Output is correct
31 Correct 268 ms 383304 KB Output is correct
32 Correct 283 ms 383304 KB Output is correct
33 Correct 253 ms 383304 KB Output is correct
34 Correct 258 ms 383324 KB Output is correct
35 Correct 249 ms 383304 KB Output is correct
36 Correct 261 ms 383304 KB Output is correct
37 Correct 277 ms 383304 KB Output is correct
38 Correct 254 ms 383288 KB Output is correct
39 Correct 251 ms 383236 KB Output is correct
40 Correct 255 ms 383308 KB Output is correct
41 Correct 254 ms 383344 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 383092 KB Output is correct
2 Correct 250 ms 384072 KB Output is correct
3 Correct 249 ms 384072 KB Output is correct
4 Correct 246 ms 384072 KB Output is correct
5 Correct 268 ms 384080 KB Output is correct
6 Correct 260 ms 384072 KB Output is correct
7 Correct 257 ms 384180 KB Output is correct
8 Correct 262 ms 384072 KB Output is correct
9 Correct 262 ms 384072 KB Output is correct
10 Correct 260 ms 384072 KB Output is correct
11 Correct 257 ms 384076 KB Output is correct
12 Correct 261 ms 383532 KB Output is correct
13 Correct 261 ms 383820 KB Output is correct
14 Correct 271 ms 383816 KB Output is correct
15 Correct 269 ms 384120 KB Output is correct
16 Correct 277 ms 384072 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 383048 KB Output is correct
2 Correct 251 ms 383052 KB Output is correct
3 Correct 269 ms 383120 KB Output is correct
4 Correct 269 ms 383048 KB Output is correct
5 Correct 262 ms 383304 KB Output is correct
6 Correct 269 ms 383136 KB Output is correct
7 Correct 271 ms 383304 KB Output is correct
8 Correct 277 ms 383300 KB Output is correct
9 Correct 251 ms 383308 KB Output is correct
10 Correct 270 ms 383304 KB Output is correct
11 Correct 276 ms 383304 KB Output is correct
12 Correct 279 ms 383084 KB Output is correct
13 Correct 261 ms 383304 KB Output is correct
14 Correct 273 ms 383304 KB Output is correct
15 Correct 264 ms 387120 KB Output is correct
16 Correct 246 ms 383048 KB Output is correct
17 Correct 273 ms 383288 KB Output is correct
18 Correct 259 ms 383340 KB Output is correct
19 Correct 276 ms 383304 KB Output is correct
20 Correct 259 ms 383412 KB Output is correct
21 Correct 230 ms 383304 KB Output is correct
22 Correct 232 ms 383292 KB Output is correct
23 Correct 246 ms 383260 KB Output is correct
24 Correct 233 ms 383372 KB Output is correct
25 Correct 230 ms 383324 KB Output is correct
26 Correct 233 ms 383240 KB Output is correct
27 Correct 249 ms 383304 KB Output is correct
28 Correct 245 ms 383452 KB Output is correct
29 Correct 271 ms 383392 KB Output is correct
30 Correct 267 ms 383304 KB Output is correct
31 Correct 268 ms 383304 KB Output is correct
32 Correct 283 ms 383304 KB Output is correct
33 Correct 253 ms 383304 KB Output is correct
34 Correct 258 ms 383324 KB Output is correct
35 Correct 249 ms 383304 KB Output is correct
36 Correct 261 ms 383304 KB Output is correct
37 Correct 277 ms 383304 KB Output is correct
38 Correct 254 ms 383288 KB Output is correct
39 Correct 251 ms 383236 KB Output is correct
40 Correct 255 ms 383308 KB Output is correct
41 Correct 254 ms 383344 KB Output is correct
42 Correct 259 ms 383092 KB Output is correct
43 Correct 250 ms 384072 KB Output is correct
44 Correct 249 ms 384072 KB Output is correct
45 Correct 246 ms 384072 KB Output is correct
46 Correct 268 ms 384080 KB Output is correct
47 Correct 260 ms 384072 KB Output is correct
48 Correct 257 ms 384180 KB Output is correct
49 Correct 262 ms 384072 KB Output is correct
50 Correct 262 ms 384072 KB Output is correct
51 Correct 260 ms 384072 KB Output is correct
52 Correct 257 ms 384076 KB Output is correct
53 Correct 261 ms 383532 KB Output is correct
54 Correct 261 ms 383820 KB Output is correct
55 Correct 271 ms 383816 KB Output is correct
56 Correct 269 ms 384120 KB Output is correct
57 Correct 277 ms 384072 KB Output is correct
58 Correct 365 ms 384072 KB Output is correct
59 Correct 358 ms 384072 KB Output is correct
60 Correct 324 ms 384392 KB Output is correct
61 Correct 316 ms 384292 KB Output is correct
62 Correct 246 ms 383972 KB Output is correct
63 Correct 255 ms 384168 KB Output is correct
64 Correct 277 ms 384072 KB Output is correct
65 Correct 282 ms 384256 KB Output is correct
66 Correct 317 ms 384072 KB Output is correct
67 Correct 335 ms 384064 KB Output is correct
68 Correct 330 ms 384120 KB Output is correct
69 Correct 329 ms 384380 KB Output is correct
70 Correct 324 ms 384072 KB Output is correct
71 Correct 334 ms 384212 KB Output is correct
72 Correct 272 ms 383816 KB Output is correct
73 Correct 259 ms 383900 KB Output is correct