oj.uz

답안 #363428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363428 2021-02-06T00:27:12 Z ijxjdjd Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 51 ms 28780 KB 
#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)

using namespace std;

using ll = long long;

const int MAXN = 400;
//int dp[MAXN][MAXN][MAXN][3];
int plc[3][MAXN];
int ft[MAXN][3];
int cnt[3];
int INF = (int)(1e8);
int main() {
	cin.tie(0);
	cin.sync_with_stdio(0);
	int N;
	cin >> N;
	FR(i, N) {
	    char a;
	    cin >> a;
	    int d = (a == 'R' ? 0 : (a == 'G' ? 1 : 2));
        cnt[d]++;
        plc[d][cnt[d]] = i;
        copy(all(cnt), begin(ft[i]));
	}
	int dp[cnt[0]+1][cnt[1]+1][cnt[2]+1][3];
	fill(all(dp[0][0][0]), 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 z = 0; z <= 2; z++) {
                    if (i == 0 && j == 0 && k == 0) {
                        dp[i][j][k][z] = 0;
                    }
                    else {
                        dp[i][j][k][z] = INF;
                        if (z == 0) {
                            if (i != 0) {
                                dp[i][j][k][z] = min(dp[i-1][j][k][1], dp[i-1][j][k][2]) + max(0, ft[plc[0][i]][1] - j) + max(0, ft[plc[0][i]][2] - k);
                            }
                        }
                        else if (z == 1) {
                            if (j != 0) {
                                dp[i][j][k][z] = min(dp[i][j-1][k][0], dp[i][j-1][k][2]) + max(0, ft[plc[1][j]][0] - i) + max(0, ft[plc[1][j]][2] - k);
                            }
                        }
                        else {
                            if (k != 0) {
                                dp[i][j][k][z] = min(dp[i][j][k-1][0], dp[i][j][k-1][1]) + max(0, ft[plc[2][k]][0] - i) + max(0, ft[plc[2][k]][1] - j);
                            }
                        }
//                        cout << i << " " << j << " " << k << " " << z << ": " <<dp[i][j][k][z] << '\n';
                    }
                }
            }
        }
    }
    cout << (*min_element(all(dp[cnt[0]][cnt[1]][cnt[2]])) >= INF ? -1 : *min_element(all(dp[cnt[0]][cnt[1]][cnt[2]]))) << '\n';
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 372 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 892 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 2 ms 748 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
14 Correct 1 ms 620 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 748 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 372 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 2 ms 892 KB Output is correct
44 Correct 2 ms 748 KB Output is correct
45 Correct 1 ms 748 KB Output is correct
46 Correct 2 ms 748 KB Output is correct
47 Correct 1 ms 748 KB Output is correct
48 Correct 1 ms 748 KB Output is correct
49 Correct 2 ms 748 KB Output is correct
50 Correct 1 ms 748 KB Output is correct
51 Correct 1 ms 748 KB Output is correct
52 Correct 2 ms 748 KB Output is correct
53 Correct 1 ms 492 KB Output is correct
54 Correct 1 ms 620 KB Output is correct
55 Correct 1 ms 620 KB Output is correct
56 Correct 1 ms 748 KB Output is correct
57 Correct 1 ms 748 KB Output is correct
58 Correct 40 ms 28524 KB Output is correct
59 Correct 41 ms 28556 KB Output is correct
60 Correct 41 ms 28268 KB Output is correct
61 Correct 42 ms 28524 KB Output is correct
62 Correct 4 ms 2668 KB Output is correct
63 Correct 9 ms 4460 KB Output is correct
64 Correct 21 ms 14188 KB Output is correct
65 Correct 30 ms 20332 KB Output is correct
66 Correct 40 ms 28140 KB Output is correct
67 Correct 39 ms 28140 KB Output is correct
68 Correct 41 ms 28620 KB Output is correct
69 Correct 41 ms 28780 KB Output is correct
70 Correct 41 ms 28716 KB Output is correct
71 Correct 51 ms 28140 KB Output is correct
72 Correct 14 ms 7552 KB Output is correct
73 Correct 4 ms 2156 KB Output is correct