Submission #256463

#	Time	Username	Problem	Language	Result	Execution time	Memory
256463		jainbot27	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	75 / 100	526 ms	757628 KiB

joi2019_ho_t3

//Author: jainbot27
#pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;


#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ts to_string
#define ub upper_bound
#define lb lower_bound
// #define ar array
#define FOR(x, y, z) for(int x = y; x < z; x++)
#define ROF(x, y, z) for(int x = y; x > z; x--)
#define all(x) x.begin(), x.end()


const char nl = '\n';
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using str = string;
using vpii = vector<pii>;
using vpll = vector<pll>;


str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
	str res = "{"; for(int i = 0;i < (int)v.size(); i++) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; for(int i = 0; i < b.size(); i++) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { 
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }


#ifdef D 
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

const int mxN = 401;
int n, dp[mxN][mxN][mxN][3], p[3][mxN];
vi pos[3];
string c;

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n >> c;
	memset(dp, -1, sizeof(dp));
	for(int i = 0; i < n; i++){
		if(c[i] == 'R'){
			p[0][i]++;
			pos[0].pb(i);
		}
		else if(c[i] == 'G'){
			p[1][i]++;
			pos[1].pb(i);
		}
		else{
			p[2][i]++;
			pos[2].pb(i);
		}
		if(i > 0){
			for(int j = 0; j < 3; j++){
				p[j][i] += p[j][i-1];
			}
		}
	} 
	dp[0][0][0][0] = 0;
	dp[0][0][0][1] = 0;
	dp[0][0][0][2] = 0;
	for(int i =0; i < n; i++){
		for(int j = 0; j <= i; j++){
			for(int k = 0; k <= i; k++){
				for(int l = 0; l < 3; l++){
					if(dp[i][j][k][l] == -1)
						continue;
					int ar = j, ag = k, ay = i - j - k;
					if(ar < (int)pos[0].size() && l != 0){
						int pr = pos[0][ar];
						if(ag > 0 && pos[1][ag-1] > pr){
							pr += p[1][pos[1][ag-1]] - p[1][pr];
						}
						if(ay > 0 && pos[2][ay-1] > pr){
							pr += p[2][pos[2][ay-1]] - p[2][pr];
						}
						if(dp[i+1][j+1][k][0] == -1 || dp[i+1][j+1][k][0] > dp[i][j][k][l] + max(pr - i, 0)){
							dp[i+1][j+1][k][0] = dp[i][j][k][l] + max(pr - i, 0);
						}
					}
					if(ag < (int)pos[1].size() && l != 1){
						int pg = pos[1][ag];
						if(ar > 0 && pos[0][ar-1] > pg){
							pg += p[0][pos[0][ar-1]] - p[0][pg];
						}
						if(ay > 0 && pos[2][ay-1] > pg){
							pg += p[2][pos[2][ay-1]] - p[2][pg];
						}
						if(dp[i+1][j][k+1][1] == -1 || dp[i+1][j][k+1][1] > dp[i][j][k][l] + max(pg - i, 0)){
							dp[i+1][j][k+1][1] = dp[i][j][k][l] + max(pg - i, 0);
						}
					}
					if(ay < (int)pos[2].size() && l != 2){
						int py = pos[2][ay];
						if(ar > 0 && pos[0][ar-1] > py){
							py += p[0][pos[0][ar-1]] - p[0][py];
						}
						if(ag > 0 && pos[1][ag-1] > py){
							py += p[1][pos[1][ag-1]] - p[1][py];
						}
						if(dp[i+1][j][k][2] == -1 || dp[i+1][j][k][2] > dp[i][j][k][l] + max(py - i, 0)){
							dp[i+1][j][k][2] = dp[i][j][k][l] + max(py - i, 0);
						}
					}
				}
			}
		}
	}
	int ans = 2e9;
	for(int i=0 ; i < 3; i++){
		if(dp[n][(int)pos[0].size()][(int)pos[1].size()][i] != -1){
			ans = min(dp[n][(int)pos[0].size()][(int)pos[1].size()][i], ans);
		}
	}

	cout << (ans==(int)2e9?-1:ans) << nl;
}

• Subtask 1: 5 / 5
• Subtask 2: 55 / 55
• Subtask 3: 15 / 15
• Subtask 4: 0 / 25