제출 #1089235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089235		vjudge1	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	15 / 100	1 ms	348 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 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 calc( int xr, int xg, string s )
{
	int tp, res = 0;
	if( xr == xg - 1 ) tp = 1;
	else if( xg == xr - 1 ) tp = 0;
		
	FOR( nw, 0, n - 1, 1 )
	{
		char ch;
		if( tp == 0 ) ch = 'R';
		else ch = 'G';
		int i = nw;
		
		while( s[i] != ch && i < n ) i ++;
		if( i == n ) break;
		while( i != nw ) swap( s[i], s[i - 1] ), i --, res ++;
		tp ^= 1;
	}
	return res;
}
void solve()
{
	cin >> n >> s;
	int xr = 0, xg = 0;
	
	FOR( i, 0, n - 1, 1 )
	{
		if( s[i] == 'R' ) xr ++;
		else xg ++;
	}
	if( abs( xr - xg ) > 1 ) 
	{
		cout << -1;
		return;
	}
	if( xr == xg ) ans = min( calc( xr - 1, xg, s ), calc( xr, xg - 1, s ));
	else ans = calc( xr, xg, s );
	
	cout << 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

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t3.cpp: In function 'long long int calc(long long int, long long int, std::string)':
joi2019_ho_t3.cpp:86:6: warning: 'tp' may be used uninitialized in this function [-Wmaybe-uninitialized]
   86 |   tp ^= 1;
      |   ~~~^~~~

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