18222022-12-04 10:07:42sztomiGyros (30)cpp17Accepted 30/303ms3412 KiB
#include <bits/stdc++.h>

using namespace std;

void solve(){
    int n, c, b;
    cin >> n >> c >> b;
    int c_db, b_db, v_db;
    c_db = b_db = v_db = 0;
    string s;
    cin >> s;
    for(int i = 0; i < n; i++){
        switch(s[i]){
        case 'C':
            c_db++;
            break;
        case 'B':
            b_db++;
            break;
        case 'V':
            v_db++;
            break;
        }
    }

    int ki = 0;
    int uj;
    for(int i = 0; i <= min(min(b, c), v_db); i++){
        uj = i + min((c-i) / 2, c_db) + min((b-i) / 2, b_db);
        ki = max(ki, uj);
    }
    cout << ki << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    while(t--){
        solve();
    }
}
SubtaskSumTestVerdictTimeMemory
base30/30
1Accepted0/03ms1700 KiB
2Accepted0/02ms1888 KiB
3Accepted2/22ms2072 KiB
4Accepted2/22ms2276 KiB
5Accepted2/22ms2476 KiB
6Accepted3/32ms2676 KiB
7Accepted3/32ms2780 KiB
8Accepted3/32ms2896 KiB
9Accepted2/22ms2972 KiB
10Accepted2/22ms2968 KiB
11Accepted2/22ms3236 KiB
12Accepted3/32ms3412 KiB
13Accepted3/32ms3404 KiB
14Accepted3/32ms3404 KiB