oj.uz

Submission #888902

# Submission time Handle Problem Language Result Execution time Memory
888902 2023-12-18T11:26:51 Z hafo Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 780372 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 400 + 7;
const ll oo = 1e9 + 69;

int n, dp[maxn][maxn][maxn][3];
char a[maxn];
vector<int> pos[3];

int convert(char ch) {
    if(ch == 'R') return 0;
    if(ch == 'G') return 1;
    return 2;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n;
    for(int i = 1; i <= n; i++) {
        cin>>a[i];
        pos[convert(a[i])].pb(i);
    }

    for(int i = 0; i <= n; i++) {
        for(int red = 0; red <= Size(pos[0]); red++) {
            for(int green = 0; green <= Size(pos[1]); green++) {
                for(int cur = 0; cur < 3; cur++) dp[i][red][green][cur] = oo;
            }
        }
    }

    dp[0][0][0][0] = 0;
    dp[0][0][0][1] = 0;
    dp[0][0][0][2] = 0;

    for(int i = 0; i < n; i++) {
        for(int red = 0; red <= Size(pos[0]); red++) {
            for(int green = 0; green <= Size(pos[1]); green++) {
                int yellow = i - red - green;
                if(yellow < 0 || yellow > Size(pos[2])) continue;
                for(int cur = 0; cur < 3; cur++) {
                    int cost;
                    if(cur != 0 && red < Size(pos[0])) {
                        cost = 0;
                        int p = pos[0][red];
                        for(int j = 0; j < red; j++) cost += (p < pos[0][j]);
                        for(int j = 0; j < green; j++) cost += (p < pos[1][j]);
                        for(int j = 0; j < yellow; j++) cost += (p < pos[2][j]);
                        mini(dp[i + 1][red + 1][green][0], dp[i][red][green][cur] + cost);
                    }

                    if(cur != 1 && green < Size(pos[1])) {
                        cost = 0;
                        int p = pos[1][green];
                        for(int j = 0; j < red; j++) cost += (p < pos[0][j]);
                        for(int j = 0; j < green; j++) cost += (p < pos[1][j]);
                        for(int j = 0; j < yellow; j++) cost += (p < pos[2][j]);
                        mini(dp[i + 1][red][green + 1][1], dp[i][red][green][cur] + cost);
                    }

                    if(cur != 2 && yellow < Size(pos[2])) {
                        cost = 0;
                        int p = pos[2][yellow];
                        for(int j = 0; j < red; j++) cost += (p < pos[0][j]);
                        for(int j = 0; j < green; j++) cost += (p < pos[1][j]);
                        for(int j = 0; j < yellow; j++) cost += (p < pos[2][j]);
                        mini(dp[i + 1][red][green][2], dp[i][red][green][cur] + cost);
                    } 
                }
            }
        }
    }

    int ans = oo;
    for(int i = 0; i < 3; i++) mini(ans, dp[n][Size(pos[0])][Size(pos[1])][i]);
    cout<<(ans == oo ? -1:ans);
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6604 KB Output is correct
4 Correct 2 ms 20828 KB Output is correct
5 Correct 4 ms 31068 KB Output is correct
6 Correct 4 ms 31068 KB Output is correct
7 Correct 4 ms 31068 KB Output is correct
8 Correct 3 ms 31068 KB Output is correct
9 Correct 4 ms 31184 KB Output is correct
10 Correct 4 ms 31064 KB Output is correct
11 Correct 4 ms 31256 KB Output is correct
12 Correct 4 ms 31068 KB Output is correct
13 Correct 4 ms 31068 KB Output is correct
14 Correct 3 ms 29020 KB Output is correct
15 Correct 5 ms 31068 KB Output is correct
16 Correct 4 ms 31252 KB Output is correct
17 Correct 3 ms 29168 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6604 KB Output is correct
4 Correct 2 ms 20828 KB Output is correct
5 Correct 4 ms 31068 KB Output is correct
6 Correct 4 ms 31068 KB Output is correct
7 Correct 4 ms 31068 KB Output is correct
8 Correct 3 ms 31068 KB Output is correct
9 Correct 4 ms 31184 KB Output is correct
10 Correct 4 ms 31064 KB Output is correct
11 Correct 4 ms 31256 KB Output is correct
12 Correct 4 ms 31068 KB Output is correct
13 Correct 4 ms 31068 KB Output is correct
14 Correct 3 ms 29020 KB Output is correct
15 Correct 5 ms 31068 KB Output is correct
16 Correct 4 ms 31252 KB Output is correct
17 Correct 3 ms 29168 KB Output is correct
18 Correct 19 ms 117336 KB Output is correct
19 Correct 14 ms 117336 KB Output is correct
20 Correct 14 ms 117532 KB Output is correct
21 Correct 14 ms 117368 KB Output is correct
22 Correct 14 ms 117492 KB Output is correct
23 Correct 14 ms 117496 KB Output is correct
24 Correct 14 ms 117340 KB Output is correct
25 Correct 12 ms 117464 KB Output is correct
26 Correct 13 ms 117340 KB Output is correct
27 Correct 14 ms 117340 KB Output is correct
28 Correct 14 ms 117340 KB Output is correct
29 Correct 14 ms 117340 KB Output is correct
30 Correct 14 ms 117436 KB Output is correct
31 Correct 14 ms 117340 KB Output is correct
32 Correct 14 ms 117444 KB Output is correct
33 Correct 12 ms 115292 KB Output is correct
34 Correct 13 ms 115292 KB Output is correct
35 Correct 14 ms 113244 KB Output is correct
36 Correct 14 ms 115288 KB Output is correct
37 Correct 13 ms 111196 KB Output is correct
38 Correct 14 ms 117340 KB Output is correct
39 Correct 14 ms 117340 KB Output is correct
40 Correct 12 ms 115288 KB Output is correct
41 Correct 13 ms 117336 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 238 ms 780264 KB Output is correct
3 Correct 140 ms 778324 KB Output is correct
4 Correct 133 ms 780216 KB Output is correct
5 Correct 130 ms 780368 KB Output is correct
6 Correct 130 ms 780352 KB Output is correct
7 Correct 133 ms 778112 KB Output is correct
8 Correct 133 ms 778328 KB Output is correct
9 Correct 135 ms 776200 KB Output is correct
10 Correct 132 ms 780364 KB Output is correct
11 Correct 138 ms 780148 KB Output is correct
12 Correct 50 ms 402568 KB Output is correct
13 Correct 69 ms 534096 KB Output is correct
14 Correct 94 ms 644808 KB Output is correct
15 Correct 134 ms 780372 KB Output is correct
16 Correct 132 ms 780172 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6604 KB Output is correct
4 Correct 2 ms 20828 KB Output is correct
5 Correct 4 ms 31068 KB Output is correct
6 Correct 4 ms 31068 KB Output is correct
7 Correct 4 ms 31068 KB Output is correct
8 Correct 3 ms 31068 KB Output is correct
9 Correct 4 ms 31184 KB Output is correct
10 Correct 4 ms 31064 KB Output is correct
11 Correct 4 ms 31256 KB Output is correct
12 Correct 4 ms 31068 KB Output is correct
13 Correct 4 ms 31068 KB Output is correct
14 Correct 3 ms 29020 KB Output is correct
15 Correct 5 ms 31068 KB Output is correct
16 Correct 4 ms 31252 KB Output is correct
17 Correct 3 ms 29168 KB Output is correct
18 Correct 19 ms 117336 KB Output is correct
19 Correct 14 ms 117336 KB Output is correct
20 Correct 14 ms 117532 KB Output is correct
21 Correct 14 ms 117368 KB Output is correct
22 Correct 14 ms 117492 KB Output is correct
23 Correct 14 ms 117496 KB Output is correct
24 Correct 14 ms 117340 KB Output is correct
25 Correct 12 ms 117464 KB Output is correct
26 Correct 13 ms 117340 KB Output is correct
27 Correct 14 ms 117340 KB Output is correct
28 Correct 14 ms 117340 KB Output is correct
29 Correct 14 ms 117340 KB Output is correct
30 Correct 14 ms 117436 KB Output is correct
31 Correct 14 ms 117340 KB Output is correct
32 Correct 14 ms 117444 KB Output is correct
33 Correct 12 ms 115292 KB Output is correct
34 Correct 13 ms 115292 KB Output is correct
35 Correct 14 ms 113244 KB Output is correct
36 Correct 14 ms 115288 KB Output is correct
37 Correct 13 ms 111196 KB Output is correct
38 Correct 14 ms 117340 KB Output is correct
39 Correct 14 ms 117340 KB Output is correct
40 Correct 12 ms 115288 KB Output is correct
41 Correct 13 ms 117336 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 238 ms 780264 KB Output is correct
44 Correct 140 ms 778324 KB Output is correct
45 Correct 133 ms 780216 KB Output is correct
46 Correct 130 ms 780368 KB Output is correct
47 Correct 130 ms 780352 KB Output is correct
48 Correct 133 ms 778112 KB Output is correct
49 Correct 133 ms 778328 KB Output is correct
50 Correct 135 ms 776200 KB Output is correct
51 Correct 132 ms 780364 KB Output is correct
52 Correct 138 ms 780148 KB Output is correct
53 Correct 50 ms 402568 KB Output is correct
54 Correct 69 ms 534096 KB Output is correct
55 Correct 94 ms 644808 KB Output is correct
56 Correct 134 ms 780372 KB Output is correct
57 Correct 132 ms 780172 KB Output is correct
58 Execution timed out 1056 ms 780372 KB Time limit exceeded
59 Halted 0 ms 0 KB -