Submission #492882

#	Time	Username	Problem	Language	Result	Execution time	Memory
492882		Biaz	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	15 / 100	1 ms	332 KiB

joi2019_ho_t3

#include <bits/stdc++.h>
#define int long long
//#define double long double
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<double,int>
#define ALL(i) i.begin(),i.end()
#define gcd(i,j) __gcd(i,j)
#define fi first
#define se second
#define eps 0.00000001
#define ist insert
#define DNE nullptr
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
//#pragma GCC optimize("O2")
int max(int x,int y){return x>=y?x:y;}
int min(int x,int y){return x>=y?y:x;}
using namespace std;
typedef int ll;
const int N=100005;
const int M=1000005;
const int MOD=1000000007;//998244353;
const int INF=1000000000000000000;//2147483647;

int n;
string s;
int c[2]{};
inline void sol(){
    cin >>n>>s;
    vector<int> R(n),G(n);
    for (int i=0;i<n;i++){
        if (s[i]=='R')
            R.pb(i);
        else G.pb(i);
    }
    if (abs((int)R.size()-(int)G.size())>1){
        cout <<-1;
        return;
    }
    if (R.size()==G.size()){
        string t=s;
        int ans=0,cnt=0;
        for (int i=0;i<n;i++){
            if (i&1){
                for (int j=i;j<n;j++)
                    if (s[j]=='G'){
                        cnt+=j-i;
                        for (int k=j;k>i;k--)
                            swap(s[k],s[k-1]);
                        break;
                    }
            }
            else{
                for (int j=i;j<n;j++)
                    if (s[j]=='R'){
                        cnt+=j-i;
                        for (int k=j;k>i;k--)
                            swap(s[k],s[k-1]);
                        break;
                    }
            }
        }
        s=t;ans=cnt;cnt=0;
        for (int i=0;i<n;i++){
            if (i&1){
                for (int j=i;j<n;j++)
                    if (s[j]=='R'){
                        cnt+=j-i;
                        for (int k=j;k>i;k--)
                            swap(s[k],s[k-1]);
                        break;
                    }
            }
            else{
                for (int j=i;j<n;j++)
                    if (s[j]=='G'){
                        cnt+=j-i;
                        for (int k=j;k>i;k--)
                            swap(s[k],s[k-1]);
                        break;
                    }
            }
        }
        cout <<min(ans,cnt)<<'\n';
    }
    else if (R.size()<G.size()){
        int cnt=0;
        for (int i=0;i<n;i++){
            if (i&1){
                for (int j=i;j<n;j++)
                    if (s[j]=='R'){
                        cnt+=j-i;
                        for (int k=j;k>i;k--)
                            swap(s[k],s[k-1]);
                        break;
                    }
            }
            else{
                for (int j=i;j<n;j++)
                    if (s[j]=='G'){
                        cnt+=j-i;
                        for (int k=j;k>i;k--)
                            swap(s[k],s[k-1]);
                        break;
                    }
            }
        }
        cout <<cnt<<'\n';
    }
    else{
        int cnt=0;
        for (int i=0;i<n;i++){
            if (i&1){
                for (int j=i;j<n;j++)
                    if (s[j]=='G'){
                        cnt+=j-i;
                        for (int k=j;k>i;k--)
                            swap(s[k],s[k-1]);
                        break;
                    }
            }
            else{
                for (int j=i;j<n;j++)
                    if (s[j]=='R'){
                        cnt+=j-i;
                        for (int k=j;k>i;k--)
                            swap(s[k],s[k-1]);
                        break;
                    }
            }
        }
        cout <<cnt<<'\n';
    }
}

signed main(){
    Nanase_Kurumi_aka_menhera_chan_is_mine
    int _=1;
    //cin >>_;
    while (_--) sol();
    return 0;
}

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