제출 #1089255

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089255		vjudge1	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	5 / 100	1069 ms	604 KiB

joi2019_ho_t3

//#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 = 1e5 + 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, k, m, w, sum, sum1, y, ans1, mx = -inf, mn = inf, ind, ind1, pref[N], suf[N];
string s1, t;
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 xr, xg, xy;

void rec( int ind = 0, int cntr = 0, int cntg = 0, int cnty = 0, string ss = "" )
{
	if( ind == n )
	{
		int rr, res = 0, ok = 1;
		
		FOR( i, 1, n - 1, 1 )
		{
			if( ss[i] == ss[i - 1] ) ok = 0;
		}
		if( !ok ) return;
		string s = s1;
		
		FOR( i, 0, n - 1, 1 )
		{
			rr = i;
			
			while( s[rr] != ss[i] && rr < n ) rr ++;
			if( rr == n ) break;
			
			while( rr > i ) swap( s[rr], s[rr - 1] ), rr --, res ++;  
		}
		if( ans > res ) ans = res, t = ss;  
		return;
	}
	if( cntr + 1 <= xr ) rec( ind + 1, cntr + 1, cntg, cnty, ss + 'R' );
	if( cntg + 1 <= xg ) rec( ind + 1, cntr, cntg + 1, cnty, ss + 'G' );
	if( cnty + 1 <= xy ) rec( ind + 1, cntr, cntg, cnty + 1, ss + 'Y' );
}
void solve()
{
	cin >> n >> s1;
	
	FOR( i, 0, n - 1, 1 )
	{
		if( s1[i] == 'R' ) xr ++;
		if( s1[i] == 'G' ) xg ++;
		if( s1[i] == 'Y' ) xy ++;
	}
	ans = inf;
	rec();
	cout << ( ans == inf ? -1 : ans );// << '\n' << t;
}
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

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