oj.uz

Submission #250734

# Submission time Handle Problem Language Result Execution time Memory
250734 2020-07-19T00:09:24 Z WhaleVomit Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 196 ms 360568 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
 
#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)
 
#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<
 
template<class T> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;}
template<class T> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}
 
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;
 
const int MAX_N = 404;
int n;
int arr[MAX_N];
int pref[MAX_N][3];
vi idxOf[3];
int dp[MAX_N][3][MAX_N][MAX_N];
 
int getcost(int c, int cnt0, int cnt1, int cnt2) { // cost to get the next c
    int idx = -1;
    if(c == 0) {
        if(cnt0 >= sz(idxOf[0])) return 1e8;
        idx = idxOf[c][cnt0];
    } else if(c == 1) {
        if(cnt1 >= sz(idxOf[1])) return 1e8;
        idx = idxOf[c][cnt1];
    } else {
        if(cnt2 >= sz(idxOf[2])) return 1e8;
        idx = idxOf[c][cnt2];
    }
    int res = idx;
    res -= min(cnt0, pref[idx][0]);
    res -= min(cnt1, pref[idx][1]);
    res -= min(cnt2, pref[idx][2]);
    return res;
}
 
int main() { FAST
    string s;
    cin >> n >> s;
    M00(i, n) {
        if(s[i] == 'R') arr[i] = 0;
        else if(s[i] == 'Y') arr[i] = 1;
        else arr[i] = 2;
    }
    M00(c, 3) {
        pref[0][c] = (arr[0] == c);
        MOO(i, 1, n) pref[i][c] = pref[i-1][c] + (arr[i] == c);
    }
    M00(i, n) idxOf[arr[i]].pb(i);
    M00(i, n) M00(j, n) if(i+j <= n-1) M00(k, 3) dp[n-1][k][i][j] = getcost(k, i, j, n-1-i-j);
    M00d(idx, n-1) {
        M00(c, 3) {
            for(int cnt0 = 0; cnt0 <= min(idx, pref[n-1][0]); cnt0++) {
                for(int cnt1 = 0; cnt1 <= min(idx-cnt0, pref[n-1][1]); cnt1++) {
                    int cnt2 = idx-cnt0-cnt1;
                    dp[idx][c][cnt0][cnt1] = 1e8;
                    if(cnt2 > pref[n-1][2]) continue;
                    int cost = getcost(c, cnt0, cnt1, cnt2);

                    int cnt20 = cnt0; if(c == 0) cnt20++;
                    int cnt21 = cnt1; if(c == 1) cnt21++;
                    M00(c2, 3) if(c2 != c) {
                        ckmin(dp[idx][c][cnt0][cnt1], cost + dp[idx+1][c2][cnt20][cnt21]);
                    }
                }
            }
        }
    }
    int res = 1e8;
    M00(i, 3) ckmin(res, dp[0][i][0][0]);
    if(res == 1e8) {
        finish(-1);
    }
    finish(res);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 640 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 896 KB Output is correct
15 Correct 1 ms 896 KB Output is correct
16 Correct 1 ms 1152 KB Output is correct
17 Correct 0 ms 640 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 640 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 896 KB Output is correct
15 Correct 1 ms 896 KB Output is correct
16 Correct 1 ms 1152 KB Output is correct
17 Correct 0 ms 640 KB Output is correct
18 Correct 4 ms 6656 KB Output is correct
19 Correct 4 ms 6016 KB Output is correct
20 Correct 4 ms 7040 KB Output is correct
21 Correct 4 ms 6144 KB Output is correct
22 Correct 4 ms 6912 KB Output is correct
23 Correct 3 ms 5632 KB Output is correct
24 Correct 3 ms 4096 KB Output is correct
25 Correct 4 ms 8576 KB Output is correct
26 Correct 4 ms 7936 KB Output is correct
27 Correct 4 ms 7296 KB Output is correct
28 Correct 3 ms 6400 KB Output is correct
29 Correct 3 ms 6528 KB Output is correct
30 Correct 3 ms 5632 KB Output is correct
31 Correct 3 ms 5248 KB Output is correct
32 Correct 4 ms 5760 KB Output is correct
33 Correct 4 ms 6912 KB Output is correct
34 Correct 3 ms 6400 KB Output is correct
35 Correct 4 ms 6400 KB Output is correct
36 Correct 4 ms 6016 KB Output is correct
37 Correct 3 ms 4480 KB Output is correct
38 Correct 3 ms 4992 KB Output is correct
39 Correct 4 ms 6016 KB Output is correct
40 Correct 1 ms 1536 KB Output is correct
41 Correct 2 ms 3840 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 146 ms 291156 KB Output is correct
3 Correct 133 ms 290168 KB Output is correct
4 Correct 134 ms 291160 KB Output is correct
5 Correct 137 ms 291192 KB Output is correct
6 Correct 129 ms 291192 KB Output is correct
7 Correct 128 ms 289272 KB Output is correct
8 Correct 132 ms 289252 KB Output is correct
9 Correct 127 ms 288252 KB Output is correct
10 Correct 131 ms 291192 KB Output is correct
11 Correct 132 ms 291192 KB Output is correct
12 Correct 37 ms 79224 KB Output is correct
13 Correct 67 ms 138232 KB Output is correct
14 Correct 92 ms 199288 KB Output is correct
15 Correct 129 ms 290168 KB Output is correct
16 Correct 127 ms 290168 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 640 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 896 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 1024 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 896 KB Output is correct
15 Correct 1 ms 896 KB Output is correct
16 Correct 1 ms 1152 KB Output is correct
17 Correct 0 ms 640 KB Output is correct
18 Correct 4 ms 6656 KB Output is correct
19 Correct 4 ms 6016 KB Output is correct
20 Correct 4 ms 7040 KB Output is correct
21 Correct 4 ms 6144 KB Output is correct
22 Correct 4 ms 6912 KB Output is correct
23 Correct 3 ms 5632 KB Output is correct
24 Correct 3 ms 4096 KB Output is correct
25 Correct 4 ms 8576 KB Output is correct
26 Correct 4 ms 7936 KB Output is correct
27 Correct 4 ms 7296 KB Output is correct
28 Correct 3 ms 6400 KB Output is correct
29 Correct 3 ms 6528 KB Output is correct
30 Correct 3 ms 5632 KB Output is correct
31 Correct 3 ms 5248 KB Output is correct
32 Correct 4 ms 5760 KB Output is correct
33 Correct 4 ms 6912 KB Output is correct
34 Correct 3 ms 6400 KB Output is correct
35 Correct 4 ms 6400 KB Output is correct
36 Correct 4 ms 6016 KB Output is correct
37 Correct 3 ms 4480 KB Output is correct
38 Correct 3 ms 4992 KB Output is correct
39 Correct 4 ms 6016 KB Output is correct
40 Correct 1 ms 1536 KB Output is correct
41 Correct 2 ms 3840 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 146 ms 291156 KB Output is correct
44 Correct 133 ms 290168 KB Output is correct
45 Correct 134 ms 291160 KB Output is correct
46 Correct 137 ms 291192 KB Output is correct
47 Correct 129 ms 291192 KB Output is correct
48 Correct 128 ms 289272 KB Output is correct
49 Correct 132 ms 289252 KB Output is correct
50 Correct 127 ms 288252 KB Output is correct
51 Correct 131 ms 291192 KB Output is correct
52 Correct 132 ms 291192 KB Output is correct
53 Correct 37 ms 79224 KB Output is correct
54 Correct 67 ms 138232 KB Output is correct
55 Correct 92 ms 199288 KB Output is correct
56 Correct 129 ms 290168 KB Output is correct
57 Correct 127 ms 290168 KB Output is correct
58 Correct 179 ms 205048 KB Output is correct
59 Correct 196 ms 231416 KB Output is correct
60 Correct 188 ms 227576 KB Output is correct
61 Correct 182 ms 217208 KB Output is correct
62 Correct 143 ms 303864 KB Output is correct
63 Correct 154 ms 286456 KB Output is correct
64 Correct 172 ms 278652 KB Output is correct
65 Correct 161 ms 248056 KB Output is correct
66 Correct 169 ms 219640 KB Output is correct
67 Correct 165 ms 190544 KB Output is correct
68 Correct 188 ms 220920 KB Output is correct
69 Correct 179 ms 221688 KB Output is correct
70 Correct 174 ms 220408 KB Output is correct
71 Correct 179 ms 238972 KB Output is correct
72 Correct 188 ms 360568 KB Output is correct
73 Correct 15 ms 16896 KB Output is correct