oj.uz

Submission #1113592

# Submission time Handle Problem Language Result Execution time Memory
1113592 2024-11-16T19:10:49 Z Dan4Life Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
75 / 100
 500 ms 405192 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+10;
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 num(int cnt0, int cnt1, int cnt2, int f0, int f1, int f2){
	if(!cnt0) return 0;
	int n1 = 0, n2 = 0, XD = v[f0][cnt0-1];
	if(cnt1 and v[f1][cnt1-1] > XD){
		int pos = lower_bound(all(v[f1]),XD)-begin(v[f1]);
		n1 = cnt1-pos;
	}
	if(cnt2 and v[f2][cnt2-1] > XD){
		int pos = lower_bound(all(v[f2]),XD)-begin(v[f2]);
		n2 = cnt2-pos;
	}
	return n1+n2;
}
 
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;
	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:48:11: warning: array subscript has type 'char' [-Wchar-subscripts]
   48 |   cnt[s[i]]++; v[s[i]].pb(i+1);
      |           ^
joi2019_ho_t3.cpp:48:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   48 |   cnt[s[i]]++; v[s[i]].pb(i+1);
      |                      ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 404872 KB Output is correct
2 Correct 294 ms 405000 KB Output is correct
3 Correct 276 ms 404912 KB Output is correct
4 Correct 324 ms 405068 KB Output is correct
5 Correct 292 ms 405064 KB Output is correct
6 Correct 287 ms 405064 KB Output is correct
7 Correct 278 ms 404860 KB Output is correct
8 Correct 279 ms 404864 KB Output is correct
9 Correct 268 ms 405064 KB Output is correct
10 Correct 281 ms 404836 KB Output is correct
11 Correct 281 ms 405064 KB Output is correct
12 Correct 263 ms 405068 KB Output is correct
13 Correct 265 ms 405064 KB Output is correct
14 Correct 261 ms 404868 KB Output is correct
15 Correct 304 ms 405068 KB Output is correct
16 Correct 289 ms 405064 KB Output is correct
17 Correct 278 ms 404984 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 404872 KB Output is correct
2 Correct 294 ms 405000 KB Output is correct
3 Correct 276 ms 404912 KB Output is correct
4 Correct 324 ms 405068 KB Output is correct
5 Correct 292 ms 405064 KB Output is correct
6 Correct 287 ms 405064 KB Output is correct
7 Correct 278 ms 404860 KB Output is correct
8 Correct 279 ms 404864 KB Output is correct
9 Correct 268 ms 405064 KB Output is correct
10 Correct 281 ms 404836 KB Output is correct
11 Correct 281 ms 405064 KB Output is correct
12 Correct 263 ms 405068 KB Output is correct
13 Correct 265 ms 405064 KB Output is correct
14 Correct 261 ms 404868 KB Output is correct
15 Correct 304 ms 405068 KB Output is correct
16 Correct 289 ms 405064 KB Output is correct
17 Correct 278 ms 404984 KB Output is correct
18 Correct 303 ms 404896 KB Output is correct
19 Correct 297 ms 405064 KB Output is correct
20 Correct 311 ms 405044 KB Output is correct
21 Correct 308 ms 405064 KB Output is correct
22 Correct 287 ms 404840 KB Output is correct
23 Correct 287 ms 405064 KB Output is correct
24 Correct 285 ms 404852 KB Output is correct
25 Correct 314 ms 405064 KB Output is correct
26 Correct 291 ms 405064 KB Output is correct
27 Correct 290 ms 405064 KB Output is correct
28 Correct 295 ms 405068 KB Output is correct
29 Correct 288 ms 405064 KB Output is correct
30 Correct 300 ms 405064 KB Output is correct
31 Correct 293 ms 404984 KB Output is correct
32 Correct 288 ms 405064 KB Output is correct
33 Correct 290 ms 404988 KB Output is correct
34 Correct 288 ms 404852 KB Output is correct
35 Correct 295 ms 404868 KB Output is correct
36 Correct 293 ms 404864 KB Output is correct
37 Correct 287 ms 404896 KB Output is correct
38 Correct 282 ms 405064 KB Output is correct
39 Correct 287 ms 405064 KB Output is correct
40 Correct 316 ms 405064 KB Output is correct
41 Correct 270 ms 405064 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 404952 KB Output is correct
2 Correct 288 ms 404956 KB Output is correct
3 Correct 286 ms 405064 KB Output is correct
4 Correct 316 ms 405064 KB Output is correct
5 Correct 292 ms 404936 KB Output is correct
6 Correct 299 ms 404976 KB Output is correct
7 Correct 291 ms 404996 KB Output is correct
8 Correct 290 ms 405064 KB Output is correct
9 Correct 296 ms 404864 KB Output is correct
10 Correct 295 ms 405192 KB Output is correct
11 Correct 300 ms 405004 KB Output is correct
12 Correct 307 ms 404852 KB Output is correct
13 Correct 278 ms 405072 KB Output is correct
14 Correct 293 ms 405064 KB Output is correct
15 Correct 289 ms 405040 KB Output is correct
16 Correct 302 ms 404900 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 404872 KB Output is correct
2 Correct 294 ms 405000 KB Output is correct
3 Correct 276 ms 404912 KB Output is correct
4 Correct 324 ms 405068 KB Output is correct
5 Correct 292 ms 405064 KB Output is correct
6 Correct 287 ms 405064 KB Output is correct
7 Correct 278 ms 404860 KB Output is correct
8 Correct 279 ms 404864 KB Output is correct
9 Correct 268 ms 405064 KB Output is correct
10 Correct 281 ms 404836 KB Output is correct
11 Correct 281 ms 405064 KB Output is correct
12 Correct 263 ms 405068 KB Output is correct
13 Correct 265 ms 405064 KB Output is correct
14 Correct 261 ms 404868 KB Output is correct
15 Correct 304 ms 405068 KB Output is correct
16 Correct 289 ms 405064 KB Output is correct
17 Correct 278 ms 404984 KB Output is correct
18 Correct 303 ms 404896 KB Output is correct
19 Correct 297 ms 405064 KB Output is correct
20 Correct 311 ms 405044 KB Output is correct
21 Correct 308 ms 405064 KB Output is correct
22 Correct 287 ms 404840 KB Output is correct
23 Correct 287 ms 405064 KB Output is correct
24 Correct 285 ms 404852 KB Output is correct
25 Correct 314 ms 405064 KB Output is correct
26 Correct 291 ms 405064 KB Output is correct
27 Correct 290 ms 405064 KB Output is correct
28 Correct 295 ms 405068 KB Output is correct
29 Correct 288 ms 405064 KB Output is correct
30 Correct 300 ms 405064 KB Output is correct
31 Correct 293 ms 404984 KB Output is correct
32 Correct 288 ms 405064 KB Output is correct
33 Correct 290 ms 404988 KB Output is correct
34 Correct 288 ms 404852 KB Output is correct
35 Correct 295 ms 404868 KB Output is correct
36 Correct 293 ms 404864 KB Output is correct
37 Correct 287 ms 404896 KB Output is correct
38 Correct 282 ms 405064 KB Output is correct
39 Correct 287 ms 405064 KB Output is correct
40 Correct 316 ms 405064 KB Output is correct
41 Correct 270 ms 405064 KB Output is correct
42 Correct 282 ms 404952 KB Output is correct
43 Correct 288 ms 404956 KB Output is correct
44 Correct 286 ms 405064 KB Output is correct
45 Correct 316 ms 405064 KB Output is correct
46 Correct 292 ms 404936 KB Output is correct
47 Correct 299 ms 404976 KB Output is correct
48 Correct 291 ms 404996 KB Output is correct
49 Correct 290 ms 405064 KB Output is correct
50 Correct 296 ms 404864 KB Output is correct
51 Correct 295 ms 405192 KB Output is correct
52 Correct 300 ms 405004 KB Output is correct
53 Correct 307 ms 404852 KB Output is correct
54 Correct 278 ms 405072 KB Output is correct
55 Correct 293 ms 405064 KB Output is correct
56 Correct 289 ms 405040 KB Output is correct
57 Correct 302 ms 404900 KB Output is correct
58 Execution timed out 644 ms 404896 KB Time limit exceeded
59 Halted 0 ms 0 KB -