//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#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 no cout << "NO\n"
#define yes cout << "YES\n"
#define nep next_permutation
#define sigma signed
#define pii pair <int, int>
using namespace std;
string alp = "abcdefghijklmnopqrstuvwxyz";
string ae = "aoeiuy";
string nums = "123456789";
const int N = 300 + 123;
const int inf = 1e18;
const int MOD = 1e9 + 7;
const int MOD1 = 998244353;
const long long maxsum = 1e14;
int a[N], b[N], c[N], l, r, n, m, w, sum, sum1, y, ans1, mx = -inf, mn = inf, ind, ind1, pref[N], suf[N];
string s, s1;
ll ans, x;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct RT
{
int sum, l, r, ind;
};
int gcd( int a, int b )
{
return ( b ? gcd( b, a % b ) : a );
}
int lcm( int a, int b )
{
return a / gcd( a, b ) * b;
}
int bp( int a, int b, int m )
{
if( !b ) return 1;
if( b & 1 ) return bp( a, b >> 1, m ) * bp( a, b >> 1, m ) % m * a % m;
else return bp( a, b >> 1, m ) * bp( a, b >> 1, m ) % m;
}
struct po
{
int mn, sum, mx;
};
int posr[N], posg[N], posy[N], pr[N], pg[N], py[N];
int dp[N][N][N][3];
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[cntr] = i, pg[i] ++;
if( s[i - 1] == 'Y' ) cnty ++, posy[cntr] = i, py[i] ++;
}
FOR( id, 1, n, 1 )
{
FOR( R, 0, n, 1 )
{
if( R > id ) break;
FOR( G, 0, n, 1 )
{
if( R + G > id ) break;
int Y = id - R - G;
if( id == 1 && R == 0 && G == 0 ) continue;
dp[id][R][G][2] = dp[id][R][G][1] = dp[id][R][G][0] = inf;
int pos0 = posr[R], cnt0 = Y - py[pos0] + G - pg[pos0], answ0 = max( 0ll, pos0 + cnt0 - id );
int pos1 = posr[G], cnt1 = Y - py[pos1] + R - pr[pos1], answ1 = max( 0ll, pos1 + cnt1 - id );
int pos2 = posr[Y], cnt2 = R - pr[pos2] + 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( R ) dp[id][R][G][1] = min( dp[id - 1][R][G - 1][1], dp[id - 1][R][G - 1][2] ) + answ1;
if( R ) dp[id][R][G][2] = min( dp[id - 1][R][G][1], dp[id - 1][R][G][2] ) + answ2;
}
}
}
cout << min({ dp[n][cntr][cntg][0], dp[n][cntr][cntg][1], dp[n][cntr][cntg][2] });
}
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 time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
