oj.uz

답안 #716383

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
716383 2023-03-29T22:32:03 Z Kahou Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
60 / 100
 500 ms 780408 KB 
/* In the name of God, aka Allah */
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#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];
pii vt[3][N];

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);
        }
        int a, b, c;
        b = 0, c = 0;
        for (int A = 0; A < (int)vc[0].size(); A++) {
                while (b < (int)vc[1].size() && vc[1][b] < vc[0][A]) b++;
                while (c < (int)vc[2].size() && vc[2][c] < vc[0][A]) c++;
                vt[0][A] = {b, c};
        }
        a = 0, c = 0;
        for (int B = 0; B < (int)vc[1].size(); B++) {
                while (a < (int)vc[0].size() && vc[0][a] < vc[1][B]) a++;
                while (c < (int)vc[2].size() && vc[2][c] < vc[1][B]) c++;
                vt[1][B] = {a, c};
        }
        a = 0, b = 0;
        for (int C = 0; C < (int)vc[2].size(); C++) {
                while (a < (int)vc[0].size() && vc[0][a] < vc[2][C]) a++;
                while (b < (int)vc[1].size() && vc[1][b] < vc[2][C]) b++;
                vt[2][C] = {a, b};
        }
        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 = vt[0][A].F;
                                        int c = vt[0][A].S;
                                        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 = vt[1][B].F;
                                        int c = vt[1][B].S;
                                        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 = vt[2][C].F;
                                        int b = vt[2][C].S;
                                        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

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 780300 KB Output is correct
2 Correct 287 ms 780284 KB Output is correct
3 Correct 279 ms 780204 KB Output is correct
4 Correct 286 ms 780292 KB Output is correct
5 Correct 294 ms 780280 KB Output is correct
6 Correct 279 ms 780292 KB Output is correct
7 Correct 296 ms 780300 KB Output is correct
8 Correct 291 ms 780312 KB Output is correct
9 Correct 278 ms 780244 KB Output is correct
10 Correct 284 ms 780284 KB Output is correct
11 Correct 276 ms 780272 KB Output is correct
12 Correct 297 ms 780332 KB Output is correct
13 Correct 286 ms 780280 KB Output is correct
14 Correct 277 ms 780236 KB Output is correct
15 Correct 419 ms 780396 KB Output is correct
16 Correct 282 ms 780288 KB Output is correct
17 Correct 280 ms 780272 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 780300 KB Output is correct
2 Correct 287 ms 780284 KB Output is correct
3 Correct 279 ms 780204 KB Output is correct
4 Correct 286 ms 780292 KB Output is correct
5 Correct 294 ms 780280 KB Output is correct
6 Correct 279 ms 780292 KB Output is correct
7 Correct 296 ms 780300 KB Output is correct
8 Correct 291 ms 780312 KB Output is correct
9 Correct 278 ms 780244 KB Output is correct
10 Correct 284 ms 780284 KB Output is correct
11 Correct 276 ms 780272 KB Output is correct
12 Correct 297 ms 780332 KB Output is correct
13 Correct 286 ms 780280 KB Output is correct
14 Correct 277 ms 780236 KB Output is correct
15 Correct 419 ms 780396 KB Output is correct
16 Correct 282 ms 780288 KB Output is correct
17 Correct 280 ms 780272 KB Output is correct
18 Correct 289 ms 780248 KB Output is correct
19 Correct 286 ms 780284 KB Output is correct
20 Correct 278 ms 780284 KB Output is correct
21 Correct 284 ms 780208 KB Output is correct
22 Correct 292 ms 780240 KB Output is correct
23 Correct 292 ms 780260 KB Output is correct
24 Correct 290 ms 780236 KB Output is correct
25 Correct 278 ms 780296 KB Output is correct
26 Correct 292 ms 780304 KB Output is correct
27 Correct 288 ms 780300 KB Output is correct
28 Correct 284 ms 780408 KB Output is correct
29 Correct 312 ms 780284 KB Output is correct
30 Correct 293 ms 780196 KB Output is correct
31 Correct 284 ms 780196 KB Output is correct
32 Correct 293 ms 780224 KB Output is correct
33 Correct 299 ms 780308 KB Output is correct
34 Correct 286 ms 780244 KB Output is correct
35 Correct 283 ms 780204 KB Output is correct
36 Correct 282 ms 780200 KB Output is correct
37 Correct 284 ms 780208 KB Output is correct
38 Correct 307 ms 780300 KB Output is correct
39 Correct 285 ms 780316 KB Output is correct
40 Correct 288 ms 780284 KB Output is correct
41 Correct 282 ms 780228 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 289 ms 780300 KB Output is correct
2 Correct 458 ms 780308 KB Output is correct
3 Execution timed out 512 ms 780308 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 780300 KB Output is correct
2 Correct 287 ms 780284 KB Output is correct
3 Correct 279 ms 780204 KB Output is correct
4 Correct 286 ms 780292 KB Output is correct
5 Correct 294 ms 780280 KB Output is correct
6 Correct 279 ms 780292 KB Output is correct
7 Correct 296 ms 780300 KB Output is correct
8 Correct 291 ms 780312 KB Output is correct
9 Correct 278 ms 780244 KB Output is correct
10 Correct 284 ms 780284 KB Output is correct
11 Correct 276 ms 780272 KB Output is correct
12 Correct 297 ms 780332 KB Output is correct
13 Correct 286 ms 780280 KB Output is correct
14 Correct 277 ms 780236 KB Output is correct
15 Correct 419 ms 780396 KB Output is correct
16 Correct 282 ms 780288 KB Output is correct
17 Correct 280 ms 780272 KB Output is correct
18 Correct 289 ms 780248 KB Output is correct
19 Correct 286 ms 780284 KB Output is correct
20 Correct 278 ms 780284 KB Output is correct
21 Correct 284 ms 780208 KB Output is correct
22 Correct 292 ms 780240 KB Output is correct
23 Correct 292 ms 780260 KB Output is correct
24 Correct 290 ms 780236 KB Output is correct
25 Correct 278 ms 780296 KB Output is correct
26 Correct 292 ms 780304 KB Output is correct
27 Correct 288 ms 780300 KB Output is correct
28 Correct 284 ms 780408 KB Output is correct
29 Correct 312 ms 780284 KB Output is correct
30 Correct 293 ms 780196 KB Output is correct
31 Correct 284 ms 780196 KB Output is correct
32 Correct 293 ms 780224 KB Output is correct
33 Correct 299 ms 780308 KB Output is correct
34 Correct 286 ms 780244 KB Output is correct
35 Correct 283 ms 780204 KB Output is correct
36 Correct 282 ms 780200 KB Output is correct
37 Correct 284 ms 780208 KB Output is correct
38 Correct 307 ms 780300 KB Output is correct
39 Correct 285 ms 780316 KB Output is correct
40 Correct 288 ms 780284 KB Output is correct
41 Correct 282 ms 780228 KB Output is correct
42 Correct 289 ms 780300 KB Output is correct
43 Correct 458 ms 780308 KB Output is correct
44 Execution timed out 512 ms 780308 KB Time limit exceeded
45 Halted 0 ms 0 KB -