제출 #529969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
529969		scottchou	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	0 / 100	1 ms	204 KiB

joi2019_ho_t3

#include<iostream>
#include<cassert>
using namespace std;
int const N = 405;
char a[N];
int main(){
    int n;
    cin >> n;
    int R = 0, G = 0;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        if(a[i] == 'R'){
            R++;
        }else if(a[i] == 'G') {
            G++;
        }
    }
    if(R != n / 2 && G != n / 2){
        cout << -1 << '\n';
        return 0;
    }
    if(n & 1){
        int cnt = 0;
        if(R > G){
            int last = 0;
            for(int i = 0; i < n; i++){
                if(a[i] == 'R'){
                    cnt += abs(i - last);
                    last += 2;
                }
            }
        }else{
            int last = 0;
            for(int i = 0; i < n; i++){
                if(a[i] == 'G'){
                    cnt += abs(i - last);
                    last += 2;
                }
            }
        }
    }else{
        int cnt1 = 0, cnt2 = 0, last1 = 0, last2 = 0;
        for(int i = 0; i < n; i++){
            if(a[i] == 'R'){
                cnt1 += abs(i - last1);
                last1 += 2;
            }else{
                cnt2 += abs(i - last2);
                last2 += 2;
            }
        }
        cout << min(cnt1, cnt2) << '\n';
    }
}

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