oj.uz

Submission #133200

# Submission time Handle Problem Language Result Execution time Memory
133200 2019-07-20T09:11:56 Z osaaateiasavtnl Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 48 ms 3732 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 401;
const int INF = 1e9 + 7;
vector <char> al = {'R', 'G', 'Y'};
int dp1[N][N][3], dp2[N][N][3];
int cnt[3];
vector <int> pos[3];
int ar[3][N][N];
char s[N];
void mm(int &a, int b) {
    a = min(a, b);
}   
int get(char c) {
    for (int i = 0; i < 3; ++i) {
        if (al[i] == c) {
            return i;
        }   
    }   
}   
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> s[i];
        ++cnt[get(s[i])];
        pos[get(s[i])].push_back(i);
    }   

    for (int t = 0; t < 3; ++t) {
        for (int i = 0; i < pos[t].size(); ++i) {
            for (int j = 0; j < N; ++j) {
                ar[t][i + 1][j] = ar[t][i][j] + (pos[t][i] > j);   
            }
        }   
    }   

    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            for (int t = 0; t < 3; ++t) {
                dp1[i][j][t] = INF;
            }   
        }   
    }   
    for (int i = 0; i < 3; ++i) {
        dp1[0][0][i] = 0;
    }   
    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 = 0; pr < 3; ++pr) {
                    dp2[j][k][pr] = INF;
                }
            }   
        }   
        for (int j = 0; j <= cnt[1]; ++j) {
            for (int k = 0; k <= cnt[2]; ++k) {
                for (int pr = 0; pr < 3; ++pr) {
                    //cout << i << ' ' << j << ' ' << k << ' ' << pr << ' ' << dp1[j][k][pr] << '\n';
                    int p = i + j + k + 1;
                    if (i < cnt[0] && pr != 0) {
                        mm(dp2[j][k][0], dp1[j][k][pr] + ar[1][j][pos[0][i]] + ar[2][k][pos[0][i]]);
                    }
                    if (j < cnt[1] && pr != 1) {
                        mm(dp1[j + 1][k][1], dp1[j][k][pr] + ar[0][i][pos[1][j]] + ar[2][k][pos[1][j]]);
                    }   
                    if (k < cnt[2] && pr != 2) {
                        mm(dp1[j][k + 1][2], dp1[j][k][pr] + ar[0][i][pos[2][k]] + ar[1][j][pos[2][k]]);
                    }   
                }
            }   
        }   
        if (i == cnt[0]) break;
        for (int j = 0; j <= cnt[1]; ++j) {
            for (int k = 0; k <= cnt[2]; ++k) {
                for (int pr = 0; pr < 3; ++pr) {
                    dp1[j][k][pr] = dp2[j][k][pr];
                }
            }   
        }   
    }   
    int ans = INF;
    for (int i = 0; i < 3; ++i) {
        ans = min(ans, dp1[cnt[1]][cnt[2]][i]);
    }   
    if (ans == INF) {
        cout << "-1\n";
    }   
    else {
        cout << ans << '\n';
    }   
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:36:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < pos[t].size(); ++i) {
                         ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:65:25: warning: unused variable 'p' [-Wunused-variable]
                     int p = i + j + k + 1;
                         ^
joi2019_ho_t3.cpp: In function 'int get(char)':
joi2019_ho_t3.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
 }   
 ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2168 KB Output is correct
2 Correct 4 ms 2168 KB Output is correct
3 Correct 3 ms 2168 KB Output is correct
4 Correct 4 ms 2300 KB Output is correct
5 Correct 4 ms 2296 KB Output is correct
6 Correct 4 ms 2296 KB Output is correct
7 Correct 4 ms 2296 KB Output is correct
8 Correct 3 ms 2296 KB Output is correct
9 Correct 3 ms 2296 KB Output is correct
10 Correct 4 ms 2296 KB Output is correct
11 Correct 4 ms 2296 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 4 ms 2296 KB Output is correct
14 Correct 4 ms 2296 KB Output is correct
15 Correct 4 ms 2296 KB Output is correct
16 Correct 4 ms 2296 KB Output is correct
17 Correct 4 ms 2296 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2168 KB Output is correct
2 Correct 4 ms 2168 KB Output is correct
3 Correct 3 ms 2168 KB Output is correct
4 Correct 4 ms 2300 KB Output is correct
5 Correct 4 ms 2296 KB Output is correct
6 Correct 4 ms 2296 KB Output is correct
7 Correct 4 ms 2296 KB Output is correct
8 Correct 3 ms 2296 KB Output is correct
9 Correct 3 ms 2296 KB Output is correct
10 Correct 4 ms 2296 KB Output is correct
11 Correct 4 ms 2296 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 4 ms 2296 KB Output is correct
14 Correct 4 ms 2296 KB Output is correct
15 Correct 4 ms 2296 KB Output is correct
16 Correct 4 ms 2296 KB Output is correct
17 Correct 4 ms 2296 KB Output is correct
18 Correct 4 ms 2472 KB Output is correct
19 Correct 4 ms 2428 KB Output is correct
20 Correct 4 ms 2424 KB Output is correct
21 Correct 4 ms 2424 KB Output is correct
22 Correct 4 ms 2424 KB Output is correct
23 Correct 4 ms 2424 KB Output is correct
24 Correct 4 ms 2396 KB Output is correct
25 Correct 4 ms 2424 KB Output is correct
26 Correct 4 ms 2424 KB Output is correct
27 Correct 4 ms 2424 KB Output is correct
28 Correct 4 ms 2424 KB Output is correct
29 Correct 4 ms 2424 KB Output is correct
30 Correct 5 ms 2424 KB Output is correct
31 Correct 4 ms 2424 KB Output is correct
32 Correct 4 ms 2424 KB Output is correct
33 Correct 4 ms 2424 KB Output is correct
34 Correct 4 ms 2424 KB Output is correct
35 Correct 4 ms 2424 KB Output is correct
36 Correct 4 ms 2452 KB Output is correct
37 Correct 4 ms 2424 KB Output is correct
38 Correct 4 ms 2424 KB Output is correct
39 Correct 4 ms 2424 KB Output is correct
40 Correct 4 ms 2424 KB Output is correct
41 Correct 4 ms 2556 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2296 KB Output is correct
2 Correct 6 ms 3704 KB Output is correct
3 Correct 6 ms 3732 KB Output is correct
4 Correct 6 ms 3704 KB Output is correct
5 Correct 6 ms 3704 KB Output is correct
6 Correct 6 ms 3704 KB Output is correct
7 Correct 6 ms 3704 KB Output is correct
8 Correct 6 ms 3704 KB Output is correct
9 Correct 7 ms 3704 KB Output is correct
10 Correct 7 ms 3704 KB Output is correct
11 Correct 6 ms 3720 KB Output is correct
12 Correct 4 ms 3000 KB Output is correct
13 Correct 5 ms 3196 KB Output is correct
14 Correct 5 ms 3448 KB Output is correct
15 Correct 6 ms 3704 KB Output is correct
16 Correct 6 ms 3704 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2168 KB Output is correct
2 Correct 4 ms 2168 KB Output is correct
3 Correct 3 ms 2168 KB Output is correct
4 Correct 4 ms 2300 KB Output is correct
5 Correct 4 ms 2296 KB Output is correct
6 Correct 4 ms 2296 KB Output is correct
7 Correct 4 ms 2296 KB Output is correct
8 Correct 3 ms 2296 KB Output is correct
9 Correct 3 ms 2296 KB Output is correct
10 Correct 4 ms 2296 KB Output is correct
11 Correct 4 ms 2296 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 4 ms 2296 KB Output is correct
14 Correct 4 ms 2296 KB Output is correct
15 Correct 4 ms 2296 KB Output is correct
16 Correct 4 ms 2296 KB Output is correct
17 Correct 4 ms 2296 KB Output is correct
18 Correct 4 ms 2472 KB Output is correct
19 Correct 4 ms 2428 KB Output is correct
20 Correct 4 ms 2424 KB Output is correct
21 Correct 4 ms 2424 KB Output is correct
22 Correct 4 ms 2424 KB Output is correct
23 Correct 4 ms 2424 KB Output is correct
24 Correct 4 ms 2396 KB Output is correct
25 Correct 4 ms 2424 KB Output is correct
26 Correct 4 ms 2424 KB Output is correct
27 Correct 4 ms 2424 KB Output is correct
28 Correct 4 ms 2424 KB Output is correct
29 Correct 4 ms 2424 KB Output is correct
30 Correct 5 ms 2424 KB Output is correct
31 Correct 4 ms 2424 KB Output is correct
32 Correct 4 ms 2424 KB Output is correct
33 Correct 4 ms 2424 KB Output is correct
34 Correct 4 ms 2424 KB Output is correct
35 Correct 4 ms 2424 KB Output is correct
36 Correct 4 ms 2452 KB Output is correct
37 Correct 4 ms 2424 KB Output is correct
38 Correct 4 ms 2424 KB Output is correct
39 Correct 4 ms 2424 KB Output is correct
40 Correct 4 ms 2424 KB Output is correct
41 Correct 4 ms 2556 KB Output is correct
42 Correct 4 ms 2296 KB Output is correct
43 Correct 6 ms 3704 KB Output is correct
44 Correct 6 ms 3732 KB Output is correct
45 Correct 6 ms 3704 KB Output is correct
46 Correct 6 ms 3704 KB Output is correct
47 Correct 6 ms 3704 KB Output is correct
48 Correct 6 ms 3704 KB Output is correct
49 Correct 6 ms 3704 KB Output is correct
50 Correct 7 ms 3704 KB Output is correct
51 Correct 7 ms 3704 KB Output is correct
52 Correct 6 ms 3720 KB Output is correct
53 Correct 4 ms 3000 KB Output is correct
54 Correct 5 ms 3196 KB Output is correct
55 Correct 5 ms 3448 KB Output is correct
56 Correct 6 ms 3704 KB Output is correct
57 Correct 6 ms 3704 KB Output is correct
58 Correct 48 ms 3448 KB Output is correct
59 Correct 48 ms 3580 KB Output is correct
60 Correct 48 ms 3576 KB Output is correct
61 Correct 48 ms 3448 KB Output is correct
62 Correct 9 ms 3576 KB Output is correct
63 Correct 12 ms 3704 KB Output is correct
64 Correct 29 ms 3704 KB Output is correct
65 Correct 37 ms 3704 KB Output is correct
66 Correct 45 ms 3576 KB Output is correct
67 Correct 47 ms 3576 KB Output is correct
68 Correct 46 ms 3448 KB Output is correct
69 Correct 47 ms 3448 KB Output is correct
70 Correct 47 ms 3576 KB Output is correct
71 Correct 47 ms 3448 KB Output is correct
72 Correct 15 ms 3064 KB Output is correct
73 Correct 8 ms 3448 KB Output is correct