oj.uz

Submission #168861

# Submission time Handle Problem Language Result Execution time Memory
168861 2019-12-16T17:27:42 Z srvlt Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 310 ms 323996 KB 
//#pragma GCC target ("avx2,sse2")
//#pragma GCC optimization ("Ofast")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree <pair <ll, int>, null_type, less <pair <ll, int> >, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define db double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define fi first
#define se second
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define endl "\n"

#define left fsdsdfoisf
#define sum dpsdfioppsf
#define assign xcvjlkdjfio
#define trie fksdfkjkfnjuiv
#define next sidlfjsfkl
#define merge sdfksdkfsldf

//#define int long long

using namespace std;

void dout() {
    cerr << endl;
}
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;

const int N = 403, inf = 1e9;
int n, dp[N][N][N][3], f[N][N][N][3], R, G, Y;
vector <int> r, g, y;
string s;

void upd(int & x, int y) {
    x = min(x, y);
}

void solve(int tc) {
    // check for (int i = 0; i < n; j++)
    cin >> n >> s;
    for (int i = 1; i <= n; i++) {
        if (s[i - 1] == 'R') {
            r.pb(i);
        }   else if (s[i - 1] == 'G') {
            g.pb(i);
        }   else {
            y.pb(i);
        }
    }
    R = sz(r), G = sz(g), Y = sz(y);
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= min(i, R); j++) {
            for (int k = 0; k <= min(i - j, G); k++) {
                int l = i - j - k;
                if (l > Y) {
                    continue;
                }
                for (int h = 0; h < 3; h++) {
                    dp[j][k][l][h] = inf;
                }
                if (j > 0) {
                    upd(dp[j][k][l][0], dp[j - 1][k][l][1]);
                    upd(dp[j][k][l][0], dp[j - 1][k][l][2]);
                    if (k > 0) {
                        f[j][k][l][0] = f[j][k - 1][l][0] + (g[k - 1] > r[j - 1]);
                    }   else if (l > 0) {
                        f[j][k][l][0] = f[j][k][l - 1][0] + (y[l - 1] > r[j - 1]);
                    }
                    dp[j][k][l][0] += abs(r[j - 1] + f[j][k][l][0] - i);
                }
                if (k > 0) {
                    upd(dp[j][k][l][1], dp[j][k - 1][l][0]);
                    upd(dp[j][k][l][1], dp[j][k - 1][l][2]);
                    if (j > 0) {
                        f[j][k][l][1] = f[j - 1][k][l][1] + (r[j - 1] > g[k - 1]);
                    }   else if (l > 0) {
                        f[j][k][l][1] = f[j][k][l - 1][1] + (y[l - 1] > g[k - 1]);
                    }
                    dp[j][k][l][1] += abs(g[k - 1] + f[j][k][l][1] - i);
                }
                if (l > 0) {
                    upd(dp[j][k][l][2], dp[j][k][l - 1][0]);
                    upd(dp[j][k][l][2], dp[j][k][l - 1][1]);
                    if (j > 0) {
                        f[j][k][l][2] = f[j - 1][k][l][2] + (r[j - 1] > y[l - 1]);
                    }   else if (k > 0) {
                        f[j][k][l][2] = f[j][k - 1][l][2] + (g[k - 1] > y[l - 1]);
                    }
                    dp[j][k][l][2] += abs(y[l - 1] + f[j][k][l][2] - i);
                }
            }
        }
    }
    int res = inf;
    for (int i = 0; i < 3; i++) {
        upd(res, dp[R][G][Y][i]);
    }
    if (res == inf) {
        res = -1;
    }
    cout << res;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 372 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 2 ms 888 KB Output is correct
11 Correct 2 ms 760 KB Output is correct
12 Correct 2 ms 808 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 376 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 372 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 2 ms 888 KB Output is correct
11 Correct 2 ms 760 KB Output is correct
12 Correct 2 ms 808 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 5 ms 4348 KB Output is correct
19 Correct 4 ms 3576 KB Output is correct
20 Correct 5 ms 4216 KB Output is correct
21 Correct 5 ms 4600 KB Output is correct
22 Correct 4 ms 3064 KB Output is correct
23 Correct 5 ms 3960 KB Output is correct
24 Correct 4 ms 2936 KB Output is correct
25 Correct 7 ms 7672 KB Output is correct
26 Correct 7 ms 8056 KB Output is correct
27 Correct 6 ms 5880 KB Output is correct
28 Correct 5 ms 4344 KB Output is correct
29 Correct 5 ms 4216 KB Output is correct
30 Correct 5 ms 4344 KB Output is correct
31 Correct 4 ms 3704 KB Output is correct
32 Correct 5 ms 4472 KB Output is correct
33 Correct 7 ms 7416 KB Output is correct
34 Correct 7 ms 6904 KB Output is correct
35 Correct 5 ms 5112 KB Output is correct
36 Correct 4 ms 3576 KB Output is correct
37 Correct 4 ms 3168 KB Output is correct
38 Correct 5 ms 3960 KB Output is correct
39 Correct 5 ms 4344 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 5 ms 4216 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 264 ms 323860 KB Output is correct
3 Correct 260 ms 322296 KB Output is correct
4 Correct 264 ms 323996 KB Output is correct
5 Correct 263 ms 323884 KB Output is correct
6 Correct 266 ms 323928 KB Output is correct
7 Correct 265 ms 322360 KB Output is correct
8 Correct 261 ms 322288 KB Output is correct
9 Correct 261 ms 320760 KB Output is correct
10 Correct 264 ms 323952 KB Output is correct
11 Correct 265 ms 323960 KB Output is correct
12 Correct 72 ms 87032 KB Output is correct
13 Correct 126 ms 152824 KB Output is correct
14 Correct 179 ms 221052 KB Output is correct
15 Correct 286 ms 323936 KB Output is correct
16 Correct 266 ms 323980 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 372 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 2 ms 888 KB Output is correct
11 Correct 2 ms 760 KB Output is correct
12 Correct 2 ms 808 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 5 ms 4348 KB Output is correct
19 Correct 4 ms 3576 KB Output is correct
20 Correct 5 ms 4216 KB Output is correct
21 Correct 5 ms 4600 KB Output is correct
22 Correct 4 ms 3064 KB Output is correct
23 Correct 5 ms 3960 KB Output is correct
24 Correct 4 ms 2936 KB Output is correct
25 Correct 7 ms 7672 KB Output is correct
26 Correct 7 ms 8056 KB Output is correct
27 Correct 6 ms 5880 KB Output is correct
28 Correct 5 ms 4344 KB Output is correct
29 Correct 5 ms 4216 KB Output is correct
30 Correct 5 ms 4344 KB Output is correct
31 Correct 4 ms 3704 KB Output is correct
32 Correct 5 ms 4472 KB Output is correct
33 Correct 7 ms 7416 KB Output is correct
34 Correct 7 ms 6904 KB Output is correct
35 Correct 5 ms 5112 KB Output is correct
36 Correct 4 ms 3576 KB Output is correct
37 Correct 4 ms 3168 KB Output is correct
38 Correct 5 ms 3960 KB Output is correct
39 Correct 5 ms 4344 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 5 ms 4216 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 264 ms 323860 KB Output is correct
44 Correct 260 ms 322296 KB Output is correct
45 Correct 264 ms 323996 KB Output is correct
46 Correct 263 ms 323884 KB Output is correct
47 Correct 266 ms 323928 KB Output is correct
48 Correct 265 ms 322360 KB Output is correct
49 Correct 261 ms 322288 KB Output is correct
50 Correct 261 ms 320760 KB Output is correct
51 Correct 264 ms 323952 KB Output is correct
52 Correct 265 ms 323960 KB Output is correct
53 Correct 72 ms 87032 KB Output is correct
54 Correct 126 ms 152824 KB Output is correct
55 Correct 179 ms 221052 KB Output is correct
56 Correct 286 ms 323936 KB Output is correct
57 Correct 266 ms 323980 KB Output is correct
58 Correct 245 ms 151472 KB Output is correct
59 Correct 285 ms 192020 KB Output is correct
60 Correct 261 ms 174584 KB Output is correct
61 Correct 259 ms 168696 KB Output is correct
62 Correct 273 ms 321016 KB Output is correct
63 Correct 276 ms 320248 KB Output is correct
64 Correct 304 ms 299896 KB Output is correct
65 Correct 310 ms 276856 KB Output is correct
66 Correct 261 ms 171124 KB Output is correct
67 Correct 257 ms 164680 KB Output is correct
68 Correct 262 ms 176248 KB Output is correct
69 Correct 261 ms 169848 KB Output is correct
70 Correct 269 ms 183928 KB Output is correct
71 Correct 256 ms 166816 KB Output is correct
72 Correct 97 ms 82552 KB Output is correct
73 Correct 9 ms 5496 KB Output is correct