oj.uz

Submission #716380

# Submission time Handle Problem Language Result Execution time Memory
716380 2023-03-29T22:18:04 Z Kahou Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
60 / 100
 500 ms 780484 KB 
/* In the name of God, aka Allah */
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 405;
int n, dp[N][N][N][3];
string s;
vector<int> vc[3];

void solve() {
        cin >> n;
        cin >> s;
        s = '.'+s;
        for (int i = 1; i <= n; i++) {
                int c = (s[i] != 'R') + (s[i] == 'Y');
                vc[c].push_back(i);
        }
        memset(dp, 64, sizeof dp);
        dp[0][0][0][0] = dp[0][0][0][1] = dp[0][0][0][2] = 0;
        for (int sum = 0; sum <= n; sum++) {
                for (int A = 0; A <= sum; A++) {
                        for (int B = 0; A+B <= sum; B++) {
                                int C = sum-A-B;
                                if (A < (int)vc[0].size()) {
                                        int b = lower_bound(vc[1].begin(), vc[1].end(), vc[0][A])-vc[1].begin();
                                        int c = lower_bound(vc[2].begin(), vc[2].end(), vc[0][A])-vc[2].begin();
                                        dp[A+1][B][C][0] = min(dp[A+1][B][C][0], min(dp[A][B][C][1], dp[A][B][C][2]) + vc[0][A]+max(B-b, 0)+max(C-c, 0)-(A+B+C+1));
                                }
                                if (B < (int)vc[1].size()) {
                                        int a = lower_bound(vc[0].begin(), vc[0].end(), vc[1][B])-vc[0].begin();
                                        int c = lower_bound(vc[2].begin(), vc[2].end(), vc[1][B])-vc[2].begin();
                                        dp[A][B+1][C][1] = min(dp[A][B+1][C][1], min(dp[A][B][C][0], dp[A][B][C][2]) + vc[1][B]+max(A-a, 0)+max(C-c, 0)-(A+B+C+1));
                                }
                                if (C < (int)vc[2].size()) {
                                        int a = lower_bound(vc[0].begin(), vc[0].end(), vc[2][C])-vc[0].begin();
                                        int b = lower_bound(vc[1].begin(), vc[1].end(), vc[2][C])-vc[1].begin();
                                        dp[A][B][C+1][2] = min(dp[A][B][C+1][2], min(dp[A][B][C][0], dp[A][B][C][1]) + vc[2][C]+max(A-a,0)+max(B-b, 0)-(A+B+C+1));
                                }
                        }
                }
        }
        int ans = 1e9;
        ans = min(dp[vc[0].size()][vc[1].size()][vc[2].size()][0], ans);
        ans = min(dp[vc[0].size()][vc[1].size()][vc[2].size()][1], ans);
        ans = min(dp[vc[0].size()][vc[1].size()][vc[2].size()][2], ans);
        cout << (ans >= 1e9? -1 : ans) << endl;
}

int main() {
        ios::sync_with_stdio(0), cin.tie(0);
        solve();
        return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 780212 KB Output is correct
2 Correct 277 ms 780180 KB Output is correct
3 Correct 275 ms 780228 KB Output is correct
4 Correct 274 ms 780240 KB Output is correct
5 Correct 415 ms 780332 KB Output is correct
6 Correct 280 ms 780268 KB Output is correct
7 Correct 304 ms 780192 KB Output is correct
8 Correct 280 ms 780364 KB Output is correct
9 Correct 274 ms 780484 KB Output is correct
10 Correct 284 ms 780184 KB Output is correct
11 Correct 276 ms 780188 KB Output is correct
12 Correct 274 ms 780240 KB Output is correct
13 Correct 273 ms 780236 KB Output is correct
14 Correct 274 ms 780324 KB Output is correct
15 Correct 275 ms 780340 KB Output is correct
16 Correct 270 ms 780304 KB Output is correct
17 Correct 277 ms 780284 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 780212 KB Output is correct
2 Correct 277 ms 780180 KB Output is correct
3 Correct 275 ms 780228 KB Output is correct
4 Correct 274 ms 780240 KB Output is correct
5 Correct 415 ms 780332 KB Output is correct
6 Correct 280 ms 780268 KB Output is correct
7 Correct 304 ms 780192 KB Output is correct
8 Correct 280 ms 780364 KB Output is correct
9 Correct 274 ms 780484 KB Output is correct
10 Correct 284 ms 780184 KB Output is correct
11 Correct 276 ms 780188 KB Output is correct
12 Correct 274 ms 780240 KB Output is correct
13 Correct 273 ms 780236 KB Output is correct
14 Correct 274 ms 780324 KB Output is correct
15 Correct 275 ms 780340 KB Output is correct
16 Correct 270 ms 780304 KB Output is correct
17 Correct 277 ms 780284 KB Output is correct
18 Correct 279 ms 780268 KB Output is correct
19 Correct 281 ms 780380 KB Output is correct
20 Correct 277 ms 780296 KB Output is correct
21 Correct 277 ms 780236 KB Output is correct
22 Correct 295 ms 780296 KB Output is correct
23 Correct 277 ms 780252 KB Output is correct
24 Correct 281 ms 780188 KB Output is correct
25 Correct 283 ms 780228 KB Output is correct
26 Correct 288 ms 780240 KB Output is correct
27 Correct 276 ms 780204 KB Output is correct
28 Correct 276 ms 780364 KB Output is correct
29 Correct 279 ms 780228 KB Output is correct
30 Correct 277 ms 780236 KB Output is correct
31 Correct 277 ms 780276 KB Output is correct
32 Correct 281 ms 780356 KB Output is correct
33 Correct 280 ms 780364 KB Output is correct
34 Correct 281 ms 780220 KB Output is correct
35 Correct 302 ms 780220 KB Output is correct
36 Correct 281 ms 780228 KB Output is correct
37 Correct 282 ms 780256 KB Output is correct
38 Correct 291 ms 780320 KB Output is correct
39 Correct 276 ms 780200 KB Output is correct
40 Correct 288 ms 780328 KB Output is correct
41 Correct 280 ms 780420 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 780208 KB Output is correct
2 Execution timed out 606 ms 780364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 780212 KB Output is correct
2 Correct 277 ms 780180 KB Output is correct
3 Correct 275 ms 780228 KB Output is correct
4 Correct 274 ms 780240 KB Output is correct
5 Correct 415 ms 780332 KB Output is correct
6 Correct 280 ms 780268 KB Output is correct
7 Correct 304 ms 780192 KB Output is correct
8 Correct 280 ms 780364 KB Output is correct
9 Correct 274 ms 780484 KB Output is correct
10 Correct 284 ms 780184 KB Output is correct
11 Correct 276 ms 780188 KB Output is correct
12 Correct 274 ms 780240 KB Output is correct
13 Correct 273 ms 780236 KB Output is correct
14 Correct 274 ms 780324 KB Output is correct
15 Correct 275 ms 780340 KB Output is correct
16 Correct 270 ms 780304 KB Output is correct
17 Correct 277 ms 780284 KB Output is correct
18 Correct 279 ms 780268 KB Output is correct
19 Correct 281 ms 780380 KB Output is correct
20 Correct 277 ms 780296 KB Output is correct
21 Correct 277 ms 780236 KB Output is correct
22 Correct 295 ms 780296 KB Output is correct
23 Correct 277 ms 780252 KB Output is correct
24 Correct 281 ms 780188 KB Output is correct
25 Correct 283 ms 780228 KB Output is correct
26 Correct 288 ms 780240 KB Output is correct
27 Correct 276 ms 780204 KB Output is correct
28 Correct 276 ms 780364 KB Output is correct
29 Correct 279 ms 780228 KB Output is correct
30 Correct 277 ms 780236 KB Output is correct
31 Correct 277 ms 780276 KB Output is correct
32 Correct 281 ms 780356 KB Output is correct
33 Correct 280 ms 780364 KB Output is correct
34 Correct 281 ms 780220 KB Output is correct
35 Correct 302 ms 780220 KB Output is correct
36 Correct 281 ms 780228 KB Output is correct
37 Correct 282 ms 780256 KB Output is correct
38 Correct 291 ms 780320 KB Output is correct
39 Correct 276 ms 780200 KB Output is correct
40 Correct 288 ms 780328 KB Output is correct
41 Correct 280 ms 780420 KB Output is correct
42 Correct 293 ms 780208 KB Output is correct
43 Execution timed out 606 ms 780364 KB Time limit exceeded
44 Halted 0 ms 0 KB -