oj.uz

Submission #99015

# Submission time Handle Problem Language Result Execution time Memory
99015 2019-02-28T05:33:44 Z 구재현(#2854, gs14004) Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
75 / 100
 500 ms 171760 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 405;
using lint = long long;
using pi = pair<int, int>;

int n;
char str[MAXN];
int dp[222][222][222][4];
vector<int> rep[3];

int cntAfter(char arg, int pos){
	int ret = 0;
	for(int i=pos+1; i<n; i++){
		if(str[i] == arg) ret++;
	}
	return ret;
}

int cost(int cR, int cG, int cY, int mode){
	int pos = -1;
	if(mode == 0) pos = rep[mode][cR-1];
	if(mode == 1) pos = rep[mode][cG-1];
	if(mode == 2) pos = rep[mode][cY-1];
	return
	max(cntAfter('R', pos) - cR, 0) +
	max(cntAfter('G', pos) - cG, 0) +
	max(cntAfter('Y', pos) - cY, 0);
}

int f(int cR, int cG, int cY, int prv){
	if(cR + cG + cY == 0) return 0;
	if(~dp[cR][cG][cY][prv]) return dp[cR][cG][cY][prv];
	int ret = 1e9;
	if(cR > 0 && prv != 0){
		ret = min(ret, f(cR - 1, cG, cY, 0) + cost(cR, cG, cY, 0));
	}
	if(cG > 0 && prv != 1){
		ret = min(ret, f(cR, cG - 1, cY, 1) + cost(cR, cG, cY, 1));
	}
	if(cY > 0 && prv != 2){
		ret = min(ret, f(cR, cG, cY - 1, 2) + cost(cR, cG, cY, 2));
	}
	return dp[cR][cG][cY][prv] = ret;
}

int main(){
	cin >> n >> str;
	memset(dp, -1, sizeof(dp));
	int cntr = count(str, str + n, 'R');
	int cntg = count(str, str + n, 'G');
	int cnty = count(str, str + n, 'Y');
	if(max({cntr, cntg, cnty}) > 202){
		puts("-1");
		return 0;
	}
	for(int i=n-1; i>=0; i--){
		if(str[i] == 'R') rep[0].push_back(i);
		if(str[i] == 'G') rep[1].push_back(i);
		if(str[i] == 'Y') rep[2].push_back(i);
	}
	int ans = f(cntr, cntg, cnty, 3);
	if(ans > 1e8) ans = -1;
	cout << ans << endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 171536 KB Output is correct
2 Correct 138 ms 171624 KB Output is correct
3 Correct 140 ms 171716 KB Output is correct
4 Correct 137 ms 171640 KB Output is correct
5 Correct 142 ms 171656 KB Output is correct
6 Correct 136 ms 171556 KB Output is correct
7 Correct 137 ms 171640 KB Output is correct
8 Correct 143 ms 171660 KB Output is correct
9 Correct 140 ms 171632 KB Output is correct
10 Correct 140 ms 171536 KB Output is correct
11 Correct 141 ms 171612 KB Output is correct
12 Correct 146 ms 171560 KB Output is correct
13 Correct 159 ms 171556 KB Output is correct
14 Correct 140 ms 171656 KB Output is correct
15 Correct 151 ms 171620 KB Output is correct
16 Correct 143 ms 171536 KB Output is correct
17 Correct 146 ms 171596 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 171536 KB Output is correct
2 Correct 138 ms 171624 KB Output is correct
3 Correct 140 ms 171716 KB Output is correct
4 Correct 137 ms 171640 KB Output is correct
5 Correct 142 ms 171656 KB Output is correct
6 Correct 136 ms 171556 KB Output is correct
7 Correct 137 ms 171640 KB Output is correct
8 Correct 143 ms 171660 KB Output is correct
9 Correct 140 ms 171632 KB Output is correct
10 Correct 140 ms 171536 KB Output is correct
11 Correct 141 ms 171612 KB Output is correct
12 Correct 146 ms 171560 KB Output is correct
13 Correct 159 ms 171556 KB Output is correct
14 Correct 140 ms 171656 KB Output is correct
15 Correct 151 ms 171620 KB Output is correct
16 Correct 143 ms 171536 KB Output is correct
17 Correct 146 ms 171596 KB Output is correct
18 Correct 146 ms 171612 KB Output is correct
19 Correct 163 ms 171604 KB Output is correct
20 Correct 154 ms 171656 KB Output is correct
21 Correct 164 ms 171760 KB Output is correct
22 Correct 154 ms 171608 KB Output is correct
23 Correct 160 ms 171604 KB Output is correct
24 Correct 155 ms 171524 KB Output is correct
25 Correct 147 ms 171612 KB Output is correct
26 Correct 145 ms 171608 KB Output is correct
27 Correct 152 ms 171644 KB Output is correct
28 Correct 144 ms 171544 KB Output is correct
29 Correct 154 ms 171616 KB Output is correct
30 Correct 147 ms 171536 KB Output is correct
31 Correct 158 ms 171640 KB Output is correct
32 Correct 139 ms 171576 KB Output is correct
33 Correct 145 ms 171560 KB Output is correct
34 Correct 141 ms 171612 KB Output is correct
35 Correct 142 ms 171612 KB Output is correct
36 Correct 141 ms 171648 KB Output is correct
37 Correct 133 ms 171568 KB Output is correct
38 Correct 140 ms 171564 KB Output is correct
39 Correct 137 ms 171612 KB Output is correct
40 Correct 148 ms 171548 KB Output is correct
41 Correct 133 ms 171712 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 171628 KB Output is correct
2 Correct 200 ms 171584 KB Output is correct
3 Correct 147 ms 171648 KB Output is correct
4 Correct 142 ms 171620 KB Output is correct
5 Correct 143 ms 171552 KB Output is correct
6 Correct 156 ms 171672 KB Output is correct
7 Correct 156 ms 171668 KB Output is correct
8 Correct 172 ms 171568 KB Output is correct
9 Correct 158 ms 171544 KB Output is correct
10 Correct 149 ms 171668 KB Output is correct
11 Correct 160 ms 171612 KB Output is correct
12 Correct 153 ms 171664 KB Output is correct
13 Correct 129 ms 171644 KB Output is correct
14 Correct 151 ms 171588 KB Output is correct
15 Correct 149 ms 171596 KB Output is correct
16 Correct 169 ms 171612 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 171536 KB Output is correct
2 Correct 138 ms 171624 KB Output is correct
3 Correct 140 ms 171716 KB Output is correct
4 Correct 137 ms 171640 KB Output is correct
5 Correct 142 ms 171656 KB Output is correct
6 Correct 136 ms 171556 KB Output is correct
7 Correct 137 ms 171640 KB Output is correct
8 Correct 143 ms 171660 KB Output is correct
9 Correct 140 ms 171632 KB Output is correct
10 Correct 140 ms 171536 KB Output is correct
11 Correct 141 ms 171612 KB Output is correct
12 Correct 146 ms 171560 KB Output is correct
13 Correct 159 ms 171556 KB Output is correct
14 Correct 140 ms 171656 KB Output is correct
15 Correct 151 ms 171620 KB Output is correct
16 Correct 143 ms 171536 KB Output is correct
17 Correct 146 ms 171596 KB Output is correct
18 Correct 146 ms 171612 KB Output is correct
19 Correct 163 ms 171604 KB Output is correct
20 Correct 154 ms 171656 KB Output is correct
21 Correct 164 ms 171760 KB Output is correct
22 Correct 154 ms 171608 KB Output is correct
23 Correct 160 ms 171604 KB Output is correct
24 Correct 155 ms 171524 KB Output is correct
25 Correct 147 ms 171612 KB Output is correct
26 Correct 145 ms 171608 KB Output is correct
27 Correct 152 ms 171644 KB Output is correct
28 Correct 144 ms 171544 KB Output is correct
29 Correct 154 ms 171616 KB Output is correct
30 Correct 147 ms 171536 KB Output is correct
31 Correct 158 ms 171640 KB Output is correct
32 Correct 139 ms 171576 KB Output is correct
33 Correct 145 ms 171560 KB Output is correct
34 Correct 141 ms 171612 KB Output is correct
35 Correct 142 ms 171612 KB Output is correct
36 Correct 141 ms 171648 KB Output is correct
37 Correct 133 ms 171568 KB Output is correct
38 Correct 140 ms 171564 KB Output is correct
39 Correct 137 ms 171612 KB Output is correct
40 Correct 148 ms 171548 KB Output is correct
41 Correct 133 ms 171712 KB Output is correct
42 Correct 140 ms 171628 KB Output is correct
43 Correct 200 ms 171584 KB Output is correct
44 Correct 147 ms 171648 KB Output is correct
45 Correct 142 ms 171620 KB Output is correct
46 Correct 143 ms 171552 KB Output is correct
47 Correct 156 ms 171672 KB Output is correct
48 Correct 156 ms 171668 KB Output is correct
49 Correct 172 ms 171568 KB Output is correct
50 Correct 158 ms 171544 KB Output is correct
51 Correct 149 ms 171668 KB Output is correct
52 Correct 160 ms 171612 KB Output is correct
53 Correct 153 ms 171664 KB Output is correct
54 Correct 129 ms 171644 KB Output is correct
55 Correct 151 ms 171588 KB Output is correct
56 Correct 149 ms 171596 KB Output is correct
57 Correct 169 ms 171612 KB Output is correct
58 Execution timed out 1079 ms 171664 KB Time limit exceeded
59 Halted 0 ms 0 KB -