oj.uz

Submission #116795

# Submission time Handle Problem Language Result Execution time Memory
116795 2019-06-13T21:39:53 Z ZwariowanyMarcin Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
5 / 100
 118 ms 163072 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>


#define pb push_back
#define ld long double
#define fi first
#define se second
#define ll long long
#define ss(x) (int) x.size()
#define mp make_pair
#define FOR(i, n) for(int i = 1; n >= i; ++i)

using namespace std;
using namespace __gnu_pbds;

const int inf = 1e9 + 1;

int dp[405][405][405][3];
int n;
string s;
int cnt[405][3];
int t[405];
vector <int> v[3];
int ile[3];
		

int main() {
	
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	
	cin >> n >> s;
	for(int i = 0; i < n; ++i) {
		if(s[i] == 'R')
			t[i + 1] = 0;
		if(s[i] == 'G')
			t[i + 1] = 1;
		if(s[i] == 'Y')
			t[i + 1] = 2;
	}
	for(int i = 0; i < 3; ++i) {
		v[i].pb(0);
	}
	for(int i = 1; i <= n; ++i) {
		for(int j = 0; j < 3; ++j) 
			cnt[i][j] = cnt[i - 1][j];
		cnt[i][t[i]]++;
		v[t[i]].pb(i);
	}
	int R = cnt[n][0];
	int G = cnt[n][1];
	int Y = cnt[n][2];
	for(int r = 0; r <= R; ++r) 
		for(int g = 0; g <= G; ++g)
			for(int y = 0; y <= Y; ++y)
				for(int z = 0; z < 3; ++z)
					dp[r][g][y][z] = inf;
	
	dp[0][0][0][0] = 0;
	dp[0][0][0][1] = 0;
	dp[0][0][0][2] = 0;
	
	int maxi = max({R, G, Y});
	if(maxi > n / 2 + 1) {
		cout << -1;
		return 0;
	}
	
	for(int r = 0; r <= R; ++r)
		for(int g = 0; g <= G; ++g)
			for(int y = 0; y <= Y; ++y) {
				for(int last = 0; last < 3; ++last) {
					
					int ans = dp[r][g][y][last];
					
					ile[0] = r;
					ile[1] = g;
					ile[2] = y;
					
					for(int i = 0; i < 3; ++i) {
						if(i == last || ile[i] + 1 == ss(v[i])) 
							continue;
						
						int pos = v[i][ile[i] + 1];
						int add = -1 + pos - r - g - y;
						
						for(int j = 0; j < 3; ++j) {
							int ost = v[j][ile[j]];
							add += max(0, cnt[ost][j] - cnt[pos][j]);
						}
						//cout << r << " " << g << " " << y << " " << " " << i << " " << ans << endl;
						ile[i]++;
						dp[ile[0]][ile[1]][ile[2]][i] = min(dp[ile[0]][ile[1]][ile[2]][i], add + ans);
						ile[i]--;
					}
				}
			}
	int best = inf;
	for(int i = 0; i < 3; ++i) 
		best = min(best, dp[R][G][Y][i]);
	cout << best;
		
	
						
	
	
	
	
	
	
	
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 2432 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 4 ms 2304 KB Output is correct
21 Correct 4 ms 2432 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 3 ms 2176 KB Output is correct
24 Correct 3 ms 1664 KB Output is correct
25 Correct 4 ms 3968 KB Output is correct
26 Incorrect 4 ms 4224 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 116 ms 163072 KB Output is correct
3 Correct 117 ms 162168 KB Output is correct
4 Correct 117 ms 162984 KB Output is correct
5 Correct 115 ms 162972 KB Output is correct
6 Correct 116 ms 163020 KB Output is correct
7 Correct 118 ms 162296 KB Output is correct
8 Correct 117 ms 162296 KB Output is correct
9 Correct 115 ms 161512 KB Output is correct
10 Correct 114 ms 163012 KB Output is correct
11 Correct 116 ms 163064 KB Output is correct
12 Correct 34 ms 44168 KB Output is correct
13 Correct 56 ms 77200 KB Output is correct
14 Correct 80 ms 111412 KB Output is correct
15 Incorrect 116 ms 163064 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 2432 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 4 ms 2304 KB Output is correct
21 Correct 4 ms 2432 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 3 ms 2176 KB Output is correct
24 Correct 3 ms 1664 KB Output is correct
25 Correct 4 ms 3968 KB Output is correct
26 Incorrect 4 ms 4224 KB Output isn't correct
27 Halted 0 ms 0 KB -