제출 #465179

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

joi2019_ho_t3

#include <bits/stdc++.h>
using namespace std;
int sonuc=0;
int sonuc2=0;
int main() {
int n;
string s;
cin >> n >> s;
string bas=s;
int r=0,g=0;

for (int i = 0; i < n; i++)
{
    if(s[i]=='R')
    r++;
    else
    g++;
}
if(abs(r-g)>1){
cout << "-1";
return 0;
}

if(r==g){
for (int i = 0; i < n; i++)
{
    if((!(i % 2)) and s[i]=='R' ){
    
    for (int j = i+1; j < n; j++){
    if(s[j]=='G'){
    swap(s[j],s[i]);
    sonuc+=j-i;
    break;
    }
    }
    }

    if((i % 2) and s[i]=='G' ){
    
    for (int j = i+1; j < n; j++){
    if(s[j]=='R'){
    swap(s[j],s[i]);
    sonuc+=j-i;
    break;
    }
    }
    }

}

s=bas;

for (int i = 0; i < n; i++)
{
    if((!(i % 2)) and s[i]=='G' ){
    
    for (int j = i+1; j < n; j++){
      //  cout << s[i]<< i <<s[j]<< j <<endl;

    if(s[j]=='R'){
    swap(s[j],s[i]);
    sonuc2+=j-i;
    break;
    }
    }
    }

    if((i % 2) and s[i]=='R' ){
    
    for (int j = i+1; j < n; j++){
      //  cout << s[i]<< i <<s[j]<< j <<endl;

    if(s[j]=='G'){
    swap(s[j],s[i]);
    sonuc2+=j-i;
    break;
    }
    }
    }

}
//cout <<sonuc << sonuc2 <<endl;
cout << min(sonuc,sonuc2);
return 0;
}
if(r>g){
for (int i = 0; i < n; i++)
{
    if((!(i % 2)) and s[i]=='G' ){
    
    for (int j = i+1; j < n; j++){
    if(s[j]=='R'){
    swap(s[j],s[i]);
    sonuc+=j-i;
    break;
    }
    }
    }

    if((i % 2) and s[i]=='R' ){
    
    for (int j = i+1; j < n; j++){
    if(s[j]=='G'){
    swap(s[j],s[i]);
    sonuc+=j-i;
    break;
    }
    }
    }

}
cout << sonuc;
return 0;
}
else
for (int i = 0; i < n; i++)
{
    if((!(i % 2)) and s[i]=='R' ){
    
    for (int j = i+1; j < n; j++){
      //  cout << s[i]<< i <<s[j]<< j <<endl;

    if(s[j]=='G'){
    swap(s[j],s[i]);
    sonuc2+=j-i;
    break;
    }
    }
    }

    if((i % 2) and s[i]=='G' ){
    
    for (int j = i+1; j < n; j++){
      //  cout << s[i]<< i <<s[j]<< j <<endl;

    if(s[j]=='R'){
    swap(s[j],s[i]);
    sonuc2+=j-i;
    break;
    }
    }
    }

}
cout << sonuc2 << endl;

}

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