oj.uz

Submission #922461

# Submission time Handle Problem Language Result Execution time Memory
922461 2024-02-05T14:18:18 Z vjudge1 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
75 / 100
 500 ms 780628 KB 
     
    #pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")    
#include <bits/stdc++.h>
     
    using namespace std;
    
    #define lli long long int
    #define MP make_pair
    #define pb push_back
    #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

     
    void fastio() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
    }
     
     
    const double EPS = 0.00001;
    const int INF = 1e9+500;
    const int N = 405;
    const int ALPH = 26;
    const int LGN = 25;
    const int MOD = 1e9+7;
    int n,m,q;
    int dp[N][N][N][3];
    vector<int> s;
    vector<int> p[3];
    int mxs[3];
    vector<int> plac[3]; // 1 - indexed
    void find_oth(int x, vector<int> &oth) {
        oth.clear();
        for(int i = 0; i<3; i++) {
            if(i == x) continue;
            oth.pb(i);
        }
        
    }
     
    void reset() {
        REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
            dp[i][j][k][t] = INF;
        } 
    }
     
    inline void solve() {
        cin>>n;
        string tmp;
        cin>>tmp;
        s.assign(n+3, -1);
        for(int i = 0; i<n; i++) {
            if(tmp[i] == 'R') s[i + 1] = 0;
            if(tmp[i] == 'G') s[i + 1] = 1;
            if(tmp[i] == 'Y') s[i + 1] = 2;
     
        }
        reset();
        REP(i,3) {
            p[i].assign(n+2, 0);
            p[i][0] = 0;
            plac[i].pb(0);
            dp[0][0][0][i] = 0;
        }
        for(int i = 1; i<=n; i++) {
            plac[ s[i] ].pb(i);
        }
        for(int t = 0; t<3; t++) {
            for(int i = 1; i<=n; i++) {
                p[t][i] = p[t][i - 1] + (s[i] == t);
            }
            mxs[t] = p[t][n];
        }
     
        for(int i = 1; i<=n; i++) {
            array<int,3> cnt;
            for(cnt[0] = 0; cnt[0] <= mxs[0]; cnt[0]++) {
                for(cnt[1] = 0; cnt[1] <= mxs[1]; cnt[1]++) {
                    if(cnt[1] + cnt[0] > i) break;
                    cnt[2] = i - cnt[0] - cnt[1];
                    if(cnt[2] > mxs[2]) continue;
                    for(int cur = 0; cur<3; cur++) {
                        if(cnt[cur] == 0) continue;
                        int ind = plac[cur][cnt[cur]];
                        int bef = 0;
                        for(int t = 0; t<3; t++) {
                            bef += min(p[t][ind - 1], cnt[t] - (t == cur));    
                        }
                        int aft = i - 1 - bef;
                        int nwind = ind + aft;
                        int cost = nwind - i;
                        vector<int> lst;
                        find_oth(cur, lst);
                        int prcnt[3];
                        for(int t = 0; t<3; t++) {
                            prcnt[t] = cnt[t];
                            if(t == cur) prcnt[t]--;
                        }
                        for(auto el : lst) {
                            dp[i][cnt[0]][cnt[1]][cur] = min(dp[i][cnt[0]][cnt[1]][cur], cost + dp[i - 1][prcnt[0]][prcnt[1]][el]);
                        }
                    }
                }
            }
        }
     
        int ans = INF;
        for(int i = 0; i<3; i++) ans = min(dp[n][mxs[0]][mxs[1]][i], ans);
        if(ans == INF) ans = -1;
        cout<<ans<<"\n"; 
    }
     
    signed main() {
     
        fastio();
        int test = 1;
        //cin>>test;
        while(test--) {
            solve();
        }
        
    }

Compilation message

joi2019_ho_t3.cpp: In function 'void reset()':
joi2019_ho_t3.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 |     #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                              ^
joi2019_ho_t3.cpp:41:9: note: in expansion of macro 'REP'
   41 |         REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
      |         ^~~
joi2019_ho_t3.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 |     #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                              ^
joi2019_ho_t3.cpp:41:18: note: in expansion of macro 'REP'
   41 |         REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
      |                  ^~~
joi2019_ho_t3.cpp:10:30: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   10 |     #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                              ^
joi2019_ho_t3.cpp:41:27: note: in expansion of macro 'REP'
   41 |         REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
      |                           ^~~
joi2019_ho_t3.cpp:10:30: warning: unnecessary parentheses in declaration of 't' [-Wparentheses]
   10 |     #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                              ^
joi2019_ho_t3.cpp:41:36: note: in expansion of macro 'REP'
   41 |         REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
      |                                    ^~~
joi2019_ho_t3.cpp: In function 'void solve()':
joi2019_ho_t3.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 |     #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                              ^
joi2019_ho_t3.cpp:58:9: note: in expansion of macro 'REP'
   58 |         REP(i,3) {
      |         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 780192 KB Output is correct
2 Correct 107 ms 780208 KB Output is correct
3 Correct 109 ms 780256 KB Output is correct
4 Correct 107 ms 780424 KB Output is correct
5 Correct 106 ms 780336 KB Output is correct
6 Correct 107 ms 780368 KB Output is correct
7 Correct 108 ms 780304 KB Output is correct
8 Correct 106 ms 780392 KB Output is correct
9 Correct 106 ms 780372 KB Output is correct
10 Correct 109 ms 780432 KB Output is correct
11 Correct 109 ms 780380 KB Output is correct
12 Correct 107 ms 780268 KB Output is correct
13 Correct 106 ms 780368 KB Output is correct
14 Correct 110 ms 780420 KB Output is correct
15 Correct 108 ms 780368 KB Output is correct
16 Correct 106 ms 780384 KB Output is correct
17 Correct 105 ms 780372 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 780192 KB Output is correct
2 Correct 107 ms 780208 KB Output is correct
3 Correct 109 ms 780256 KB Output is correct
4 Correct 107 ms 780424 KB Output is correct
5 Correct 106 ms 780336 KB Output is correct
6 Correct 107 ms 780368 KB Output is correct
7 Correct 108 ms 780304 KB Output is correct
8 Correct 106 ms 780392 KB Output is correct
9 Correct 106 ms 780372 KB Output is correct
10 Correct 109 ms 780432 KB Output is correct
11 Correct 109 ms 780380 KB Output is correct
12 Correct 107 ms 780268 KB Output is correct
13 Correct 106 ms 780368 KB Output is correct
14 Correct 110 ms 780420 KB Output is correct
15 Correct 108 ms 780368 KB Output is correct
16 Correct 106 ms 780384 KB Output is correct
17 Correct 105 ms 780372 KB Output is correct
18 Correct 106 ms 780360 KB Output is correct
19 Correct 108 ms 780372 KB Output is correct
20 Correct 110 ms 780344 KB Output is correct
21 Correct 109 ms 780368 KB Output is correct
22 Correct 108 ms 780424 KB Output is correct
23 Correct 114 ms 780252 KB Output is correct
24 Correct 109 ms 780368 KB Output is correct
25 Correct 106 ms 780368 KB Output is correct
26 Correct 107 ms 780376 KB Output is correct
27 Correct 107 ms 780436 KB Output is correct
28 Correct 111 ms 780368 KB Output is correct
29 Correct 108 ms 780368 KB Output is correct
30 Correct 109 ms 780372 KB Output is correct
31 Correct 114 ms 780272 KB Output is correct
32 Correct 107 ms 780368 KB Output is correct
33 Correct 110 ms 780352 KB Output is correct
34 Correct 105 ms 780256 KB Output is correct
35 Correct 111 ms 780416 KB Output is correct
36 Correct 108 ms 780368 KB Output is correct
37 Correct 109 ms 780252 KB Output is correct
38 Correct 108 ms 780372 KB Output is correct
39 Correct 107 ms 780244 KB Output is correct
40 Correct 112 ms 780204 KB Output is correct
41 Correct 106 ms 780368 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 780416 KB Output is correct
2 Correct 126 ms 780492 KB Output is correct
3 Correct 122 ms 780416 KB Output is correct
4 Correct 123 ms 780424 KB Output is correct
5 Correct 123 ms 780236 KB Output is correct
6 Correct 122 ms 780340 KB Output is correct
7 Correct 122 ms 780436 KB Output is correct
8 Correct 128 ms 780368 KB Output is correct
9 Correct 121 ms 780448 KB Output is correct
10 Correct 123 ms 780388 KB Output is correct
11 Correct 130 ms 780448 KB Output is correct
12 Correct 109 ms 780372 KB Output is correct
13 Correct 116 ms 780364 KB Output is correct
14 Correct 116 ms 780340 KB Output is correct
15 Correct 124 ms 780200 KB Output is correct
16 Correct 124 ms 780276 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 780192 KB Output is correct
2 Correct 107 ms 780208 KB Output is correct
3 Correct 109 ms 780256 KB Output is correct
4 Correct 107 ms 780424 KB Output is correct
5 Correct 106 ms 780336 KB Output is correct
6 Correct 107 ms 780368 KB Output is correct
7 Correct 108 ms 780304 KB Output is correct
8 Correct 106 ms 780392 KB Output is correct
9 Correct 106 ms 780372 KB Output is correct
10 Correct 109 ms 780432 KB Output is correct
11 Correct 109 ms 780380 KB Output is correct
12 Correct 107 ms 780268 KB Output is correct
13 Correct 106 ms 780368 KB Output is correct
14 Correct 110 ms 780420 KB Output is correct
15 Correct 108 ms 780368 KB Output is correct
16 Correct 106 ms 780384 KB Output is correct
17 Correct 105 ms 780372 KB Output is correct
18 Correct 106 ms 780360 KB Output is correct
19 Correct 108 ms 780372 KB Output is correct
20 Correct 110 ms 780344 KB Output is correct
21 Correct 109 ms 780368 KB Output is correct
22 Correct 108 ms 780424 KB Output is correct
23 Correct 114 ms 780252 KB Output is correct
24 Correct 109 ms 780368 KB Output is correct
25 Correct 106 ms 780368 KB Output is correct
26 Correct 107 ms 780376 KB Output is correct
27 Correct 107 ms 780436 KB Output is correct
28 Correct 111 ms 780368 KB Output is correct
29 Correct 108 ms 780368 KB Output is correct
30 Correct 109 ms 780372 KB Output is correct
31 Correct 114 ms 780272 KB Output is correct
32 Correct 107 ms 780368 KB Output is correct
33 Correct 110 ms 780352 KB Output is correct
34 Correct 105 ms 780256 KB Output is correct
35 Correct 111 ms 780416 KB Output is correct
36 Correct 108 ms 780368 KB Output is correct
37 Correct 109 ms 780252 KB Output is correct
38 Correct 108 ms 780372 KB Output is correct
39 Correct 107 ms 780244 KB Output is correct
40 Correct 112 ms 780204 KB Output is correct
41 Correct 106 ms 780368 KB Output is correct
42 Correct 106 ms 780416 KB Output is correct
43 Correct 126 ms 780492 KB Output is correct
44 Correct 122 ms 780416 KB Output is correct
45 Correct 123 ms 780424 KB Output is correct
46 Correct 123 ms 780236 KB Output is correct
47 Correct 122 ms 780340 KB Output is correct
48 Correct 122 ms 780436 KB Output is correct
49 Correct 128 ms 780368 KB Output is correct
50 Correct 121 ms 780448 KB Output is correct
51 Correct 123 ms 780388 KB Output is correct
52 Correct 130 ms 780448 KB Output is correct
53 Correct 109 ms 780372 KB Output is correct
54 Correct 116 ms 780364 KB Output is correct
55 Correct 116 ms 780340 KB Output is correct
56 Correct 124 ms 780200 KB Output is correct
57 Correct 124 ms 780276 KB Output is correct
58 Execution timed out 505 ms 780628 KB Time limit exceeded
59 Halted 0 ms 0 KB -