Submission #1089445

#TimeUsernameProblemLanguageResultExecution timeMemory
1089445vjudge1Growing Vegetable is Fun 3 (JOI19_ho_t3)C++17
100 / 100
311 ms380884 KiB
//#pragma GCC optimize ("O3") //#pragma GCC target ("sse4") #include <bits/stdc++.h> #define ll long long #define ld long double #define ull unsigned long long #define pb push_back #define pob pop_back #define int long long #define int2 __int128_t #define Shrek_Crush228 ios_base::sync_with_stdio(0), cin.tie(0); #define F first #define S second #define FOR( i, x, n, d ) for( int i = x; i <= n; i += d ) #define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d ) #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() #define sigma signed #define pii pair <int, int> using namespace std; const int N = 400 + 1; const int inf = 1e18; int a[N], b[N], c[N], l, r, n, m, ans, x; string s, s1; int posr[N], posg[N], posy[N], pr[N], pg[N], py[N]; void solve() { cin >> n >> s; int cntr = 0, cntg = 0, cnty = 0; FOR( i, 1, n, 1 ) { pr[i] = pr[i - 1], pg[i] = pg[i - 1], py[i] = py[i - 1]; if( s[i - 1] == 'R' ) cntr ++, posr[cntr] = i, pr[i] ++; if( s[i - 1] == 'G' ) cntg ++, posg[cntg] = i, pg[i] ++; if( s[i - 1] == 'Y' ) cnty ++, posy[cnty] = i, py[i] ++; } int dp[n + 1][cntr + 1][cntg + 1][3]; FOR( id, 1, n, 1 ) { FOR( R, 0, cntr, 1 ) { FOR( G, 0, cntg, 1 ) dp[id][R][G][0] = inf, dp[id][R][G][1] = inf, dp[id][R][G][2] = inf; } } dp[0][0][0][0] = 0, dp[0][0][0][1] = 0, dp[0][0][0][2] = 0; FOR( id, 1, n, 1 ) { FOR( R, 0, cntr, 1 ) { if( R > id ) break; FOR( G, 0, cntg, 1 ) { if( R + G > id ) break; int Y = id - R - G; if( Y > cnty ) continue; int pos0 = posr[R], cnt0 = max( 0ll, Y - py[pos0] ) + max( 0ll, G - pg[pos0] ), answ0 = max( 0ll, pos0 + cnt0 - id ); int pos1 = posg[G], cnt1 = max( 0ll, Y - py[pos1] ) + max( 0ll, R - pr[pos1] ), answ1 = max( 0ll, pos1 + cnt1 - id ); int pos2 = posy[Y], cnt2 = max( 0ll, R - pr[pos2] ) + max( 0ll, G - pg[pos2] ), answ2 = max( 0ll, pos2 + cnt2 - id ); if( R ) dp[id][R][G][0] = min( dp[id - 1][R - 1][G][1], dp[id - 1][R - 1][G][2] ) + answ0; if( G ) dp[id][R][G][1] = min( dp[id - 1][R][G - 1][0], dp[id - 1][R][G - 1][2] ) + answ1; if( Y ) dp[id][R][G][2] = min( dp[id - 1][R][G][0], dp[id - 1][R][G][1] ) + answ2; } } } ans = min({ dp[n][cntr][cntg][0], dp[n][cntr][cntg][1], dp[n][cntr][cntg][2] }); cout << ( ans >= inf ? -1 : ans ); } sigma main() { //freopen("rmq.in", "r", stdin); //freopen("rmq.out", "w", stdout); Shrek_Crush228 int test = 1; if( !test ) cin >> test; while( test -- ) { solve(); } } // solved by KluydQ
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...