Submission #1113585

#	Time	Username	Problem	Language	Result	Execution time	Memory
1113585		Dan4Life	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	0 / 100	385 ms	410636 KiB

joi2019_ho_t3

#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
 
using vi = vector<int>;
using ll = long long;
using ar2 = array<ll,2>;
 
const int N = (int)4e2+10;
const int INF = (int)1e9;
const ll LINF = (ll)2e18;
 
 
vi v[3];
string s;
int n, cnt[3];
int dp[N][3][N/2][N/2];

int num(int cnt0, int cnt1, int cnt2, int f0, int f1, int f2){
	if(!cnt0) return 0;
	int n1 = 0, n2 = 0;
	int XD = v[f0][cnt0-1];
	if(cnt1 and v[f1][cnt1-1] > XD){
		int pos = lower_bound(all(v[f1]),XD)-begin(v[f1]);
		n1 = cnt1-pos;
	}
	if(cnt2 and v[f2][cnt2-1] > XD){
		int pos = lower_bound(all(v[f2]),XD)-begin(v[f2]);
		n2 = cnt2-pos;
	}
	return n1+n2;
}
 
int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> s;
	for(int i = 0; i < n; i++){
		char u = s[i];
		if(u=='R') s[i]=0;
		else if(u=='G') s[i]=1;
		else s[i]=2;
		cnt[s[i]]++; v[s[i]].pb(i+1);
	}
	if(cnt[0]>max(cnt[1],cnt[2]))
		swap(cnt[0],cnt[2]), swap(v[0],v[2]);
	else if(cnt[1]>max(cnt[0],cnt[2]))
		swap(cnt[1],cnt[2]), swap(v[1],v[2]);
	memset(dp,0x3f3f3f3f,sizeof(dp));
	if(cnt[0]) dp[1][0][1][0] = v[0][0]-1;
	if(cnt[1]) dp[1][1][0][1] = v[1][0]-1;
	if(cnt[2]) dp[1][2][0][0] = v[2][0]-1;
	int ans = INF;
	for(int i = 2; i <= n; i++){
		for(int j = 0; j < 3; j++){
			for(int m = 0; m < 3; m++){
				if(m==j) continue;
				for(int k = 0; k <= min(i,cnt[0]); k++){
					for(int l = 0; l <= min(i,cnt[1]); l++){
						int o = i-k-l; if(o>i or o>cnt[2]) continue;
						if(k and j==0){
							int f0 = v[0][k-1]+num(k,l,o,0,1,2);
							if(f0>=i) dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-1][m][k-1][l]+f0-i);
						}
						if(l and j==1){
							int f1 = v[1][l-1]+num(l,k,o,1,0,2);
							if(f1>=i) dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-1][m][k][l-1]+f1-i);
						}
						if(o and j==2){
							int f2 = v[2][o-1]+num(o,k,l,2,0,1);
							if(f2>=i) dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-1][m][k][l]+f2-i);
						}
						if(i==n) ans = min(ans, dp[i][j][k][l]);
					}
				}
			}
		}
	}
	if(ans>=INF) ans=-1;
	cout << ans << "\n";
}

Compilation message (stderr)

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:45:11: warning: array subscript has type 'char' [-Wchar-subscripts]
   45 |   cnt[s[i]]++; v[s[i]].pb(i+1);
      |           ^
joi2019_ho_t3.cpp:45:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   45 |   cnt[s[i]]++; v[s[i]].pb(i+1);
      |                      ^

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