oj.uz

Submission #710383

# Submission time Handle Problem Language Result Execution time Memory
710383 2023-03-15T07:58:03 Z lukameladze Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 118 ms 165300 KB 
# include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
//#define int long long
#define pii pair <int, int>
#define pb push_back
const int N = 401, inf = 1e9;
int t,n,a[N], dp[N][N][N][3],pr[N][3], cnt[3];
bool fix[N][N][N][3];
string s;
vector <int> vec[3];
int get_cnt(int le, int ri, int ty) {
    if (le > ri) return 0;
    return pr[ri][ty] - pr[le - 1][ty];
}
int get(int i, int j, int k, int ty) {
    //cout<<"get "<<i<<" "<<j<<" "<<k<<" "<<ty<<"\n";
    if (ty == 0) {
        return get_cnt(vec[1][j] + 1, vec[0][i], 1) + get_cnt(vec[2][k] + 1, vec[0][i], 2);
    } 
    if (ty == 1) {
        return get_cnt(vec[0][i] + 1, vec[1][j], 0) + get_cnt(vec[2][k] + 1, vec[1][j], 2);
    }
    if (ty == 2) {
        return get_cnt(vec[0][i] + 1, vec[2][k], 0) + get_cnt(vec[1][j] + 1, vec[2][k], 1);
    }
}
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>s;
    s = "@" + s;
    for (int i = 0; i < 3; i++) {
        vec[i].pb(0);
    }
    for (int i = 1; i <= n; i++) {
        if (s[i] == 'R')  s[i] = 'a'; else s[i] = (s[i] == 'G' ? 'b' : 'c');
        vec[s[i] - 'a'].pb(i); cnt[s[i] - 'a']++;
        for (int j = 0; j < 3; j++) {
            pr[i][j] += pr[i - 1][j];
        }
        pr[i][s[i] - 'a']++;
    }
    for (int i = 0; i <= cnt[0]; i++) {
        for (int j = 0; j <= cnt[1]; j++) {
            for (int k = 0; k <= cnt[2]; k++) {
                for (int lst = 0; lst <= 2; lst++) {
                    dp[i][j][k][lst] = inf;
                    if (i + j + k == 0) {
                        dp[i][j][k][lst] = 0; fix[i][j][k][lst] = -1;
                    }
                }
            }
        }
    }
    for (int i = 0; i <= cnt[0]; i++) {
        for (int j = 0; j <= cnt[1]; j++) {
            for (int k = 0; k <= cnt[2]; k++) {
                for (int pr_lst = 0; pr_lst <= 2; pr_lst++) {
                    if (!fix[i][j][k][pr_lst]) continue;
                    if (i < cnt[0] && pr_lst != 0) {
                        dp[i + 1][j][k][0] = min(dp[i + 1][j][k][0], dp[i][j][k][pr_lst] + get(i + 1, j, k, 0));
                        fix[i + 1][j][k][0] = 1;
                    }
                    if (j < cnt[1] && pr_lst != 1) {
                        dp[i][j + 1][k][1] = min(dp[i][j + 1][k][1], dp[i][j][k][pr_lst] + get(i, j + 1, k, 1)); fix[i][j + 1][k][1] = 1;
                    }
                    if (k < cnt[2] && pr_lst != 2) {
                        dp[i][j][k + 1][2] = min(dp[i][j][k + 1][2], dp[i][j][k][pr_lst] + get(i, j, k + 1, 2)); fix[i][j][k + 1][2] = 1;
                    }
                }
            }
        }
    }
    int mn = min(dp[cnt[0]][cnt[1]][cnt[2]][0], dp[cnt[0]][cnt[1]][cnt[2]][1]);
    mn = min(mn, dp[cnt[0]][cnt[1]][cnt[2]][2]);
    cout<<(mn == inf ? -1 : mn)<<"\n";
}

Compilation message

joi2019_ho_t3.cpp:29:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   29 | main() {
      | ^~~~
joi2019_ho_t3.cpp: In function 'int get(int, int, int, int)':
joi2019_ho_t3.cpp:28:1: warning: control reaches end of non-void function [-Wreturn-type]
   28 | }
      | ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 584 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 376 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 584 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 376 KB Output is correct
18 Correct 2 ms 2888 KB Output is correct
19 Correct 2 ms 2388 KB Output is correct
20 Correct 2 ms 2772 KB Output is correct
21 Correct 2 ms 3028 KB Output is correct
22 Correct 1 ms 2132 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 1952 KB Output is correct
25 Correct 2 ms 4304 KB Output is correct
26 Correct 2 ms 4436 KB Output is correct
27 Correct 2 ms 3668 KB Output is correct
28 Correct 2 ms 2896 KB Output is correct
29 Correct 3 ms 2772 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2504 KB Output is correct
32 Correct 2 ms 3028 KB Output is correct
33 Correct 3 ms 4180 KB Output is correct
34 Correct 2 ms 3924 KB Output is correct
35 Correct 2 ms 3284 KB Output is correct
36 Correct 1 ms 2376 KB Output is correct
37 Correct 1 ms 2132 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 2 ms 2900 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 2380 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 75 ms 164388 KB Output is correct
3 Correct 60 ms 163532 KB Output is correct
4 Correct 63 ms 164328 KB Output is correct
5 Correct 64 ms 164428 KB Output is correct
6 Correct 61 ms 164348 KB Output is correct
7 Correct 62 ms 163556 KB Output is correct
8 Correct 65 ms 163516 KB Output is correct
9 Correct 85 ms 162748 KB Output is correct
10 Correct 59 ms 164416 KB Output is correct
11 Correct 74 ms 164404 KB Output is correct
12 Correct 19 ms 44788 KB Output is correct
13 Correct 41 ms 78028 KB Output is correct
14 Correct 53 ms 112452 KB Output is correct
15 Correct 64 ms 164392 KB Output is correct
16 Correct 62 ms 164340 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 584 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 376 KB Output is correct
18 Correct 2 ms 2888 KB Output is correct
19 Correct 2 ms 2388 KB Output is correct
20 Correct 2 ms 2772 KB Output is correct
21 Correct 2 ms 3028 KB Output is correct
22 Correct 1 ms 2132 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 1952 KB Output is correct
25 Correct 2 ms 4304 KB Output is correct
26 Correct 2 ms 4436 KB Output is correct
27 Correct 2 ms 3668 KB Output is correct
28 Correct 2 ms 2896 KB Output is correct
29 Correct 3 ms 2772 KB Output is correct
30 Correct 2 ms 2772 KB Output is correct
31 Correct 2 ms 2504 KB Output is correct
32 Correct 2 ms 3028 KB Output is correct
33 Correct 3 ms 4180 KB Output is correct
34 Correct 2 ms 3924 KB Output is correct
35 Correct 2 ms 3284 KB Output is correct
36 Correct 1 ms 2376 KB Output is correct
37 Correct 1 ms 2132 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 2 ms 2900 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 2380 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 75 ms 164388 KB Output is correct
44 Correct 60 ms 163532 KB Output is correct
45 Correct 63 ms 164328 KB Output is correct
46 Correct 64 ms 164428 KB Output is correct
47 Correct 61 ms 164348 KB Output is correct
48 Correct 62 ms 163556 KB Output is correct
49 Correct 65 ms 163516 KB Output is correct
50 Correct 85 ms 162748 KB Output is correct
51 Correct 59 ms 164416 KB Output is correct
52 Correct 74 ms 164404 KB Output is correct
53 Correct 19 ms 44788 KB Output is correct
54 Correct 41 ms 78028 KB Output is correct
55 Correct 53 ms 112452 KB Output is correct
56 Correct 64 ms 164392 KB Output is correct
57 Correct 62 ms 164340 KB Output is correct
58 Correct 78 ms 94612 KB Output is correct
59 Correct 88 ms 119276 KB Output is correct
60 Correct 118 ms 108928 KB Output is correct
61 Correct 94 ms 105332 KB Output is correct
62 Correct 63 ms 163660 KB Output is correct
63 Correct 64 ms 165300 KB Output is correct
64 Correct 79 ms 164648 KB Output is correct
65 Correct 83 ms 158408 KB Output is correct
66 Correct 102 ms 106788 KB Output is correct
67 Correct 80 ms 102696 KB Output is correct
68 Correct 86 ms 110036 KB Output is correct
69 Correct 95 ms 106040 KB Output is correct
70 Correct 101 ms 114668 KB Output is correct
71 Correct 92 ms 104036 KB Output is correct
72 Correct 23 ms 44696 KB Output is correct
73 Correct 3 ms 3412 KB Output is correct