oj.uz

답안 #529963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529963 2022-02-24T06:53:36 Z scottchou Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
0 / 100
 1 ms 332 KB 
#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++;
        }
        assert(a[i] != 'Y');
    }
    if(R != n / 2 && G != n / 2){
        cout << -1 << '\n';
        return 0;
    }
    if(n & 1){
        int cnt = 0;
        for(int i = 0; i < n; i += 2){
            if(R > G){
                if(a[i] != 'R'){
                    cnt++;
                }
            }else{
                if(a[i] != 'G'){
                    cnt++;
                }
            }
        }
        cout << cnt << '\n';
    }else{
        int cnt1 = 0, cnt2 = 0;
        for(int i = 0; i < n; i += 2){
            if(a[i] == 'R')
                cnt1++;
            else{
                cnt2++;
            }
        }
        cout << min(cnt1, cnt2) << '\n';
    }
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 1 ms 332 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 1 ms 332 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 1 ms 332 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -