oj.uz

Submission #341567

# Submission time Handle Problem Language Result Execution time Memory
341567 2020-12-30T03:52:01 Z limabeans Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 115 ms 162924 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 444;
const int inf = 1e9;


int n;
string s;
int a[maxn];
int dp[maxn][maxn][maxn][3];

vector<int> inds[maxn];
int prevs[3][maxn]; // prev[j][i]: # of j's in a[0...i-1]

void upd(int &x, int y) {
    x=min(x,y);
}


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);

    cin>>n;
    cin>>s;
    for (int i=0; i<n; i++) {
	if (s[i]=='R') {
	    a[i]=0;
	} else if (s[i]=='G') {
	    a[i]=1;
	} else if (s[i]=='Y') {
	    a[i]=2;
	} else assert(false);
    }

    for (int i=0; i<n; i++) {
	inds[a[i]].push_back(i);
	for (int j=0; j<3; j++) {
	    prevs[j][i] = inds[j].size();
	}
    }

    for (int a=0; a<=(int)inds[0].size(); a++) {
	for (int b=0; b<=(int)inds[1].size(); b++) {
	    for (int c=0; c<=(int)inds[2].size(); c++) {
		for (int last=0; last<3; last++) {
		    dp[a][b][c][last] = inf;
		}
	    }
	}
    }

    for (int last=0; last<3; last++) {
	dp[0][0][0][last] = 0;
    }

    

    for (int a=0; a<=(int)inds[0].size(); a++) {
	for (int b=0; b<=(int)inds[1].size(); b++) {
	    for (int c=0; c<=(int)inds[2].size(); c++) {
		for (int last=0; last<3; last++) {
		    // place R
		    // to place it, need to swap past all the G and Y's
		    if (a<(int)inds[0].size() && last!=0) {
			int p = inds[0][a];
			int cur = dp[a][b][c][last] + max(0, prevs[1][p]-b) + max(0, prevs[2][p]-c);
			upd(dp[a+1][b][c][0], cur);
		    }
		    // place G
		    if (b<(int)inds[1].size() && last!=1) {
			int p = inds[1][b];
			int cur = dp[a][b][c][last] + max(0, prevs[0][p]-a) + max(0, prevs[2][p]-c);
			upd(dp[a][b+1][c][1], cur);
		    }
		    // place Y
		    if (c<(int)inds[2].size() && last!=2) {
			int p = inds[2][c];
			int cur = dp[a][b][c][last] + max(0, prevs[0][p]-a) + max(0, prevs[1][p]-b);
			upd(dp[a][b][c+1][2], cur);
		    }
		}
	    }
	}
    }

    int res = inf; 
    for (int i=0; i<3; i++) {
	res = min(res, dp[(int)inds[0].size()][(int)inds[1].size()][(int)inds[2].size()][i]);
    }

    if (res > inf/2) res = -1;
    out(res);
    
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 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 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 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 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 2412 KB Output is correct
19 Correct 2 ms 1900 KB Output is correct
20 Correct 2 ms 2284 KB Output is correct
21 Correct 2 ms 2412 KB Output is correct
22 Correct 1 ms 1772 KB Output is correct
23 Correct 2 ms 2156 KB Output is correct
24 Correct 1 ms 1644 KB Output is correct
25 Correct 3 ms 3948 KB Output is correct
26 Correct 3 ms 4352 KB Output is correct
27 Correct 2 ms 3052 KB Output is correct
28 Correct 2 ms 2412 KB Output is correct
29 Correct 2 ms 2284 KB Output is correct
30 Correct 2 ms 2284 KB Output is correct
31 Correct 2 ms 2028 KB Output is correct
32 Correct 2 ms 2412 KB Output is correct
33 Correct 3 ms 3948 KB Output is correct
34 Correct 3 ms 3564 KB Output is correct
35 Correct 2 ms 2796 KB Output is correct
36 Correct 2 ms 1900 KB Output is correct
37 Correct 1 ms 1772 KB Output is correct
38 Correct 2 ms 2156 KB Output is correct
39 Correct 2 ms 2412 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 2 ms 2284 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 88 ms 162924 KB Output is correct
3 Correct 85 ms 162028 KB Output is correct
4 Correct 82 ms 162924 KB Output is correct
5 Correct 90 ms 162924 KB Output is correct
6 Correct 88 ms 162924 KB Output is correct
7 Correct 80 ms 162028 KB Output is correct
8 Correct 93 ms 162172 KB Output is correct
9 Correct 84 ms 161260 KB Output is correct
10 Correct 87 ms 162924 KB Output is correct
11 Correct 85 ms 162924 KB Output is correct
12 Correct 23 ms 44084 KB Output is correct
13 Correct 41 ms 77164 KB Output is correct
14 Correct 60 ms 111360 KB Output is correct
15 Correct 89 ms 162796 KB Output is correct
16 Correct 89 ms 162924 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 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 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 2412 KB Output is correct
19 Correct 2 ms 1900 KB Output is correct
20 Correct 2 ms 2284 KB Output is correct
21 Correct 2 ms 2412 KB Output is correct
22 Correct 1 ms 1772 KB Output is correct
23 Correct 2 ms 2156 KB Output is correct
24 Correct 1 ms 1644 KB Output is correct
25 Correct 3 ms 3948 KB Output is correct
26 Correct 3 ms 4352 KB Output is correct
27 Correct 2 ms 3052 KB Output is correct
28 Correct 2 ms 2412 KB Output is correct
29 Correct 2 ms 2284 KB Output is correct
30 Correct 2 ms 2284 KB Output is correct
31 Correct 2 ms 2028 KB Output is correct
32 Correct 2 ms 2412 KB Output is correct
33 Correct 3 ms 3948 KB Output is correct
34 Correct 3 ms 3564 KB Output is correct
35 Correct 2 ms 2796 KB Output is correct
36 Correct 2 ms 1900 KB Output is correct
37 Correct 1 ms 1772 KB Output is correct
38 Correct 2 ms 2156 KB Output is correct
39 Correct 2 ms 2412 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 2 ms 2284 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 88 ms 162924 KB Output is correct
44 Correct 85 ms 162028 KB Output is correct
45 Correct 82 ms 162924 KB Output is correct
46 Correct 90 ms 162924 KB Output is correct
47 Correct 88 ms 162924 KB Output is correct
48 Correct 80 ms 162028 KB Output is correct
49 Correct 93 ms 162172 KB Output is correct
50 Correct 84 ms 161260 KB Output is correct
51 Correct 87 ms 162924 KB Output is correct
52 Correct 85 ms 162924 KB Output is correct
53 Correct 23 ms 44084 KB Output is correct
54 Correct 41 ms 77164 KB Output is correct
55 Correct 60 ms 111360 KB Output is correct
56 Correct 89 ms 162796 KB Output is correct
57 Correct 89 ms 162924 KB Output is correct
58 Correct 93 ms 83692 KB Output is correct
59 Correct 112 ms 106000 KB Output is correct
60 Correct 115 ms 96364 KB Output is correct
61 Correct 98 ms 93036 KB Output is correct
62 Correct 91 ms 160492 KB Output is correct
63 Correct 93 ms 160176 KB Output is correct
64 Correct 105 ms 150380 KB Output is correct
65 Correct 114 ms 138548 KB Output is correct
66 Correct 95 ms 94444 KB Output is correct
67 Correct 93 ms 90860 KB Output is correct
68 Correct 115 ms 97304 KB Output is correct
69 Correct 95 ms 93676 KB Output is correct
70 Correct 99 ms 101484 KB Output is correct
71 Correct 94 ms 92140 KB Output is correct
72 Correct 35 ms 42476 KB Output is correct
73 Correct 7 ms 3180 KB Output is correct