oj.uz

Submission #883170

# Submission time Handle Problem Language Result Execution time Memory
883170 2023-12-04T17:08:36 Z efedmrlr Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 431 ms 780644 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

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 'std::string to_string(std::string, int, int)':
joi2019_ho_t3.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
joi2019_ho_t3.cpp: In function 'void reset()':
joi2019_ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
joi2019_ho_t3.cpp:46:5: note: in expansion of macro 'REP'
   46 |     REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
      |     ^~~
joi2019_ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
joi2019_ho_t3.cpp:46:14: note: in expansion of macro 'REP'
   46 |     REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
      |              ^~~
joi2019_ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
joi2019_ho_t3.cpp:46:23: note: in expansion of macro 'REP'
   46 |     REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
      |                       ^~~
joi2019_ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 't' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
joi2019_ho_t3.cpp:46:32: note: in expansion of macro 'REP'
   46 |     REP(i,N) REP(j,N) REP(k,N) REP(t,3) {
      |                                ^~~
joi2019_ho_t3.cpp: In function 'void solve()':
joi2019_ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
joi2019_ho_t3.cpp:63:5: note: in expansion of macro 'REP'
   63 |     REP(i,3) {
      |     ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 780304 KB Output is correct
2 Correct 188 ms 780380 KB Output is correct
3 Correct 175 ms 780192 KB Output is correct
4 Correct 190 ms 780440 KB Output is correct
5 Correct 176 ms 780368 KB Output is correct
6 Correct 167 ms 780184 KB Output is correct
7 Correct 171 ms 780368 KB Output is correct
8 Correct 168 ms 780256 KB Output is correct
9 Correct 167 ms 780312 KB Output is correct
10 Correct 168 ms 780376 KB Output is correct
11 Correct 138 ms 780228 KB Output is correct
12 Correct 129 ms 780264 KB Output is correct
13 Correct 137 ms 780368 KB Output is correct
14 Correct 129 ms 780368 KB Output is correct
15 Correct 124 ms 780572 KB Output is correct
16 Correct 123 ms 780312 KB Output is correct
17 Correct 120 ms 780372 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 780304 KB Output is correct
2 Correct 188 ms 780380 KB Output is correct
3 Correct 175 ms 780192 KB Output is correct
4 Correct 190 ms 780440 KB Output is correct
5 Correct 176 ms 780368 KB Output is correct
6 Correct 167 ms 780184 KB Output is correct
7 Correct 171 ms 780368 KB Output is correct
8 Correct 168 ms 780256 KB Output is correct
9 Correct 167 ms 780312 KB Output is correct
10 Correct 168 ms 780376 KB Output is correct
11 Correct 138 ms 780228 KB Output is correct
12 Correct 129 ms 780264 KB Output is correct
13 Correct 137 ms 780368 KB Output is correct
14 Correct 129 ms 780368 KB Output is correct
15 Correct 124 ms 780572 KB Output is correct
16 Correct 123 ms 780312 KB Output is correct
17 Correct 120 ms 780372 KB Output is correct
18 Correct 119 ms 780372 KB Output is correct
19 Correct 120 ms 780424 KB Output is correct
20 Correct 120 ms 780372 KB Output is correct
21 Correct 120 ms 780244 KB Output is correct
22 Correct 116 ms 780372 KB Output is correct
23 Correct 120 ms 780456 KB Output is correct
24 Correct 113 ms 780208 KB Output is correct
25 Correct 118 ms 780368 KB Output is correct
26 Correct 105 ms 780200 KB Output is correct
27 Correct 108 ms 780320 KB Output is correct
28 Correct 107 ms 780232 KB Output is correct
29 Correct 116 ms 780368 KB Output is correct
30 Correct 106 ms 780236 KB Output is correct
31 Correct 105 ms 780644 KB Output is correct
32 Correct 109 ms 780244 KB Output is correct
33 Correct 105 ms 780204 KB Output is correct
34 Correct 103 ms 780396 KB Output is correct
35 Correct 104 ms 780436 KB Output is correct
36 Correct 105 ms 780364 KB Output is correct
37 Correct 106 ms 780300 KB Output is correct
38 Correct 104 ms 780248 KB Output is correct
39 Correct 109 ms 780432 KB Output is correct
40 Correct 103 ms 780196 KB Output is correct
41 Correct 113 ms 780196 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 780340 KB Output is correct
2 Correct 118 ms 780216 KB Output is correct
3 Correct 128 ms 780200 KB Output is correct
4 Correct 120 ms 780336 KB Output is correct
5 Correct 119 ms 780260 KB Output is correct
6 Correct 128 ms 780324 KB Output is correct
7 Correct 120 ms 780460 KB Output is correct
8 Correct 117 ms 780364 KB Output is correct
9 Correct 116 ms 780248 KB Output is correct
10 Correct 130 ms 780368 KB Output is correct
11 Correct 117 ms 780612 KB Output is correct
12 Correct 103 ms 780368 KB Output is correct
13 Correct 109 ms 780376 KB Output is correct
14 Correct 115 ms 780368 KB Output is correct
15 Correct 122 ms 780436 KB Output is correct
16 Correct 128 ms 780368 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 780304 KB Output is correct
2 Correct 188 ms 780380 KB Output is correct
3 Correct 175 ms 780192 KB Output is correct
4 Correct 190 ms 780440 KB Output is correct
5 Correct 176 ms 780368 KB Output is correct
6 Correct 167 ms 780184 KB Output is correct
7 Correct 171 ms 780368 KB Output is correct
8 Correct 168 ms 780256 KB Output is correct
9 Correct 167 ms 780312 KB Output is correct
10 Correct 168 ms 780376 KB Output is correct
11 Correct 138 ms 780228 KB Output is correct
12 Correct 129 ms 780264 KB Output is correct
13 Correct 137 ms 780368 KB Output is correct
14 Correct 129 ms 780368 KB Output is correct
15 Correct 124 ms 780572 KB Output is correct
16 Correct 123 ms 780312 KB Output is correct
17 Correct 120 ms 780372 KB Output is correct
18 Correct 119 ms 780372 KB Output is correct
19 Correct 120 ms 780424 KB Output is correct
20 Correct 120 ms 780372 KB Output is correct
21 Correct 120 ms 780244 KB Output is correct
22 Correct 116 ms 780372 KB Output is correct
23 Correct 120 ms 780456 KB Output is correct
24 Correct 113 ms 780208 KB Output is correct
25 Correct 118 ms 780368 KB Output is correct
26 Correct 105 ms 780200 KB Output is correct
27 Correct 108 ms 780320 KB Output is correct
28 Correct 107 ms 780232 KB Output is correct
29 Correct 116 ms 780368 KB Output is correct
30 Correct 106 ms 780236 KB Output is correct
31 Correct 105 ms 780644 KB Output is correct
32 Correct 109 ms 780244 KB Output is correct
33 Correct 105 ms 780204 KB Output is correct
34 Correct 103 ms 780396 KB Output is correct
35 Correct 104 ms 780436 KB Output is correct
36 Correct 105 ms 780364 KB Output is correct
37 Correct 106 ms 780300 KB Output is correct
38 Correct 104 ms 780248 KB Output is correct
39 Correct 109 ms 780432 KB Output is correct
40 Correct 103 ms 780196 KB Output is correct
41 Correct 113 ms 780196 KB Output is correct
42 Correct 108 ms 780340 KB Output is correct
43 Correct 118 ms 780216 KB Output is correct
44 Correct 128 ms 780200 KB Output is correct
45 Correct 120 ms 780336 KB Output is correct
46 Correct 119 ms 780260 KB Output is correct
47 Correct 128 ms 780324 KB Output is correct
48 Correct 120 ms 780460 KB Output is correct
49 Correct 117 ms 780364 KB Output is correct
50 Correct 116 ms 780248 KB Output is correct
51 Correct 130 ms 780368 KB Output is correct
52 Correct 117 ms 780612 KB Output is correct
53 Correct 103 ms 780368 KB Output is correct
54 Correct 109 ms 780376 KB Output is correct
55 Correct 115 ms 780368 KB Output is correct
56 Correct 122 ms 780436 KB Output is correct
57 Correct 128 ms 780368 KB Output is correct
58 Correct 424 ms 780444 KB Output is correct
59 Correct 401 ms 780368 KB Output is correct
60 Correct 416 ms 780628 KB Output is correct
61 Correct 428 ms 780372 KB Output is correct
62 Correct 137 ms 780372 KB Output is correct
63 Correct 158 ms 780456 KB Output is correct
64 Correct 269 ms 780372 KB Output is correct
65 Correct 343 ms 780448 KB Output is correct
66 Correct 407 ms 780372 KB Output is correct
67 Correct 431 ms 780444 KB Output is correct
68 Correct 428 ms 780448 KB Output is correct
69 Correct 411 ms 780360 KB Output is correct
70 Correct 422 ms 780448 KB Output is correct
71 Correct 407 ms 780368 KB Output is correct
72 Correct 193 ms 780392 KB Output is correct
73 Correct 119 ms 780440 KB Output is correct