제출 #118265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
118265		Charis02	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	0 / 100	2 ms	384 KiB

joi2019_ho_t3

#include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 300004
#define INF 1e9+7

using namespace std;

ll n,ans;
string s;
ll cntr,cntg,cnty;

int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n;
    cin >> s;

    rep(i,0,n)
    {
        if(s[i] == 'Y')
            cnty++;
        else if(s[i] == 'R')
            cntr++;
        else
            cntg++;
    }

    if(cnty*2 > n+1 || cntr*2 > n+1 || cntg*2 > n+1)
    {
        cout << -1 << endl;
        return 0;
    }

    rep(i,1,n)
    {
        if(s[i] == s[i-1])
        {
            ll f = i+1;

            while(s[f] == s[i])
                f++;

            char tmp = s[i];
            s[i] = s[f];
            s[f] = tmp;
            ans += f-i;
        }
    }

    cout << ans;

    return 0;
}

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