oj.uz

Submission #1113611

# Submission time Handle Problem Language Result Execution time Memory
1113611 2024-11-16T19:50:09 Z Dan4Life Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 360 ms 382024 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define all(a) begin(a),end(a)
 
const int N = (int)4e2+2;
const int INF = (int)1e9;
 
vector<int> v[3];
int dp[N][3][N/2][N];
int n, cnt[3], chk[3][3][N];

int num(int cnt0, int cnt1, int cnt2, int f0, int f1, int f2){
    return max(0,cnt1-chk[f0][f1][cnt0])+max(0,cnt2-chk[f0][f2][cnt0]);
}
 
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);
    string s; 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));
    for(int i : {0,1,2}) dp[0][i][0][0]=0;
    for(int f0 = 0; f0 < 3; f0++)
        for(int f1 = 0; f1 < 3; f1++)
            for(int cnt0 = 1; cnt0 <= cnt[f0] and f0!=f1; cnt0++)
                chk[f0][f1][cnt0] = lower_bound(all(v[f1]),v[f0][cnt0-1])-begin(v[f1]);
    int ans = INF;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < 3; j++){
            for(int m = 0; m < 3; m++){
                for(int k = 0; k <= min(i,cnt[0]) and m!=j; 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:28:17: warning: array subscript has type 'char' [-Wchar-subscripts]
   28 |         cnt[s[i]]++; v[s[i]].pb(i+1);
      |                 ^
joi2019_ho_t3.cpp:28:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   28 |         cnt[s[i]]++; v[s[i]].pb(i+1);
      |                            ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 381768 KB Output is correct
2 Correct 230 ms 381696 KB Output is correct
3 Correct 234 ms 381656 KB Output is correct
4 Correct 248 ms 381808 KB Output is correct
5 Correct 249 ms 381768 KB Output is correct
6 Correct 257 ms 381772 KB Output is correct
7 Correct 263 ms 381768 KB Output is correct
8 Correct 257 ms 381768 KB Output is correct
9 Correct 260 ms 381772 KB Output is correct
10 Correct 266 ms 381664 KB Output is correct
11 Correct 263 ms 381800 KB Output is correct
12 Correct 273 ms 381768 KB Output is correct
13 Correct 257 ms 381784 KB Output is correct
14 Correct 268 ms 381668 KB Output is correct
15 Correct 277 ms 381768 KB Output is correct
16 Correct 251 ms 381660 KB Output is correct
17 Correct 266 ms 381768 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 381768 KB Output is correct
2 Correct 230 ms 381696 KB Output is correct
3 Correct 234 ms 381656 KB Output is correct
4 Correct 248 ms 381808 KB Output is correct
5 Correct 249 ms 381768 KB Output is correct
6 Correct 257 ms 381772 KB Output is correct
7 Correct 263 ms 381768 KB Output is correct
8 Correct 257 ms 381768 KB Output is correct
9 Correct 260 ms 381772 KB Output is correct
10 Correct 266 ms 381664 KB Output is correct
11 Correct 263 ms 381800 KB Output is correct
12 Correct 273 ms 381768 KB Output is correct
13 Correct 257 ms 381784 KB Output is correct
14 Correct 268 ms 381668 KB Output is correct
15 Correct 277 ms 381768 KB Output is correct
16 Correct 251 ms 381660 KB Output is correct
17 Correct 266 ms 381768 KB Output is correct
18 Correct 272 ms 381688 KB Output is correct
19 Correct 263 ms 381768 KB Output is correct
20 Correct 270 ms 381800 KB Output is correct
21 Correct 252 ms 381792 KB Output is correct
22 Correct 248 ms 381796 KB Output is correct
23 Correct 263 ms 381768 KB Output is correct
24 Correct 257 ms 381840 KB Output is correct
25 Correct 254 ms 381640 KB Output is correct
26 Correct 236 ms 381768 KB Output is correct
27 Correct 244 ms 381764 KB Output is correct
28 Correct 243 ms 381620 KB Output is correct
29 Correct 235 ms 381768 KB Output is correct
30 Correct 244 ms 382024 KB Output is correct
31 Correct 237 ms 381800 KB Output is correct
32 Correct 243 ms 381704 KB Output is correct
33 Correct 239 ms 381768 KB Output is correct
34 Correct 241 ms 381856 KB Output is correct
35 Correct 279 ms 381840 KB Output is correct
36 Correct 272 ms 381768 KB Output is correct
37 Correct 268 ms 381768 KB Output is correct
38 Correct 267 ms 381768 KB Output is correct
39 Correct 261 ms 381836 KB Output is correct
40 Correct 241 ms 381768 KB Output is correct
41 Correct 258 ms 381768 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 381708 KB Output is correct
2 Correct 275 ms 381736 KB Output is correct
3 Correct 280 ms 381768 KB Output is correct
4 Correct 278 ms 381768 KB Output is correct
5 Correct 256 ms 381684 KB Output is correct
6 Correct 261 ms 381768 KB Output is correct
7 Correct 255 ms 381768 KB Output is correct
8 Correct 290 ms 381768 KB Output is correct
9 Correct 249 ms 381768 KB Output is correct
10 Correct 267 ms 381768 KB Output is correct
11 Correct 249 ms 381768 KB Output is correct
12 Correct 236 ms 381772 KB Output is correct
13 Correct 237 ms 381636 KB Output is correct
14 Correct 248 ms 381768 KB Output is correct
15 Correct 238 ms 381660 KB Output is correct
16 Correct 246 ms 381760 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 381768 KB Output is correct
2 Correct 230 ms 381696 KB Output is correct
3 Correct 234 ms 381656 KB Output is correct
4 Correct 248 ms 381808 KB Output is correct
5 Correct 249 ms 381768 KB Output is correct
6 Correct 257 ms 381772 KB Output is correct
7 Correct 263 ms 381768 KB Output is correct
8 Correct 257 ms 381768 KB Output is correct
9 Correct 260 ms 381772 KB Output is correct
10 Correct 266 ms 381664 KB Output is correct
11 Correct 263 ms 381800 KB Output is correct
12 Correct 273 ms 381768 KB Output is correct
13 Correct 257 ms 381784 KB Output is correct
14 Correct 268 ms 381668 KB Output is correct
15 Correct 277 ms 381768 KB Output is correct
16 Correct 251 ms 381660 KB Output is correct
17 Correct 266 ms 381768 KB Output is correct
18 Correct 272 ms 381688 KB Output is correct
19 Correct 263 ms 381768 KB Output is correct
20 Correct 270 ms 381800 KB Output is correct
21 Correct 252 ms 381792 KB Output is correct
22 Correct 248 ms 381796 KB Output is correct
23 Correct 263 ms 381768 KB Output is correct
24 Correct 257 ms 381840 KB Output is correct
25 Correct 254 ms 381640 KB Output is correct
26 Correct 236 ms 381768 KB Output is correct
27 Correct 244 ms 381764 KB Output is correct
28 Correct 243 ms 381620 KB Output is correct
29 Correct 235 ms 381768 KB Output is correct
30 Correct 244 ms 382024 KB Output is correct
31 Correct 237 ms 381800 KB Output is correct
32 Correct 243 ms 381704 KB Output is correct
33 Correct 239 ms 381768 KB Output is correct
34 Correct 241 ms 381856 KB Output is correct
35 Correct 279 ms 381840 KB Output is correct
36 Correct 272 ms 381768 KB Output is correct
37 Correct 268 ms 381768 KB Output is correct
38 Correct 267 ms 381768 KB Output is correct
39 Correct 261 ms 381836 KB Output is correct
40 Correct 241 ms 381768 KB Output is correct
41 Correct 258 ms 381768 KB Output is correct
42 Correct 304 ms 381708 KB Output is correct
43 Correct 275 ms 381736 KB Output is correct
44 Correct 280 ms 381768 KB Output is correct
45 Correct 278 ms 381768 KB Output is correct
46 Correct 256 ms 381684 KB Output is correct
47 Correct 261 ms 381768 KB Output is correct
48 Correct 255 ms 381768 KB Output is correct
49 Correct 290 ms 381768 KB Output is correct
50 Correct 249 ms 381768 KB Output is correct
51 Correct 267 ms 381768 KB Output is correct
52 Correct 249 ms 381768 KB Output is correct
53 Correct 236 ms 381772 KB Output is correct
54 Correct 237 ms 381636 KB Output is correct
55 Correct 248 ms 381768 KB Output is correct
56 Correct 238 ms 381660 KB Output is correct
57 Correct 246 ms 381760 KB Output is correct
58 Correct 311 ms 381708 KB Output is correct
59 Correct 308 ms 381768 KB Output is correct
60 Correct 331 ms 381812 KB Output is correct
61 Correct 310 ms 381664 KB Output is correct
62 Correct 256 ms 381776 KB Output is correct
63 Correct 264 ms 381768 KB Output is correct
64 Correct 293 ms 381764 KB Output is correct
65 Correct 313 ms 381840 KB Output is correct
66 Correct 351 ms 381700 KB Output is correct
67 Correct 342 ms 381680 KB Output is correct
68 Correct 359 ms 381624 KB Output is correct
69 Correct 357 ms 381776 KB Output is correct
70 Correct 360 ms 381768 KB Output is correct
71 Correct 335 ms 381692 KB Output is correct
72 Correct 292 ms 381720 KB Output is correct
73 Correct 272 ms 381712 KB Output is correct