Submission #1000257

#TimeUsernameProblemLanguageResultExecution timeMemory
1000257biximoGrowing Vegetable is Fun 3 (JOI19_ho_t3)C++17
15 / 100
473 ms1040536 KiB
#include <bits/stdc++.h> #define N 405 #define INF 2000000000 using namespace std; int n,dp[N][N][N][4], rs[N], gs[N], ys[N]; string s; int cost(int r, int g, int y, int i) { return abs(rs[i]-r)+abs(gs[i]-g)+abs(ys[i]-y); } int main() { cin.tie(0)->sync_with_stdio(0); cin >> n >> s; for(int i = 1; i <= n; i ++) { rs[i] = rs[i-1]+(s[i-1]=='R'); gs[i] = gs[i-1]+(s[i-1]=='G'); ys[i] = ys[i-1]+(s[i-1]=='Y'); } for(auto&i: dp) for(auto&j: i) for(auto&k: j) for(auto&l: k) l = INF; dp[0][0][0][0] = 0; for(int i = 0; i < n; i ++) { for(int r = 0; r <= i && r <= rs[n]; r ++) { for(int g = 0; r+g <= i && g <= gs[n]; g ++) { int y = i-r-g; if(y > ys[n]) continue; for(int t = (i!=0); t <= 3; t ++) { if(t != 1) dp[i+1][r+1][g][1] = min(dp[i+1][r+1][g][1],dp[i][r][g][t]+cost(r+1,g,y,i+1)); if(t != 2) dp[i+1][r][g+1][2] = min(dp[i+1][r][g+1][2],dp[i][r][g][t]+cost(r,g+1,y,i+1)); if(t != 3) dp[i+1][r][g][3] = min(dp[i+1][r][g][3],dp[i][r][g][t]+cost(r,g,y+1,i+1)); } } } } int res = min({dp[n][rs[n]][gs[n]][1],dp[n][rs[n]][gs[n]][2],dp[n][rs[n]][gs[n]][3]})/2; if(res == INF/2) cout << -1; else cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...