제출 #534465

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534465		bonk	Miners (IOI07_miners)	C++14	16 / 100	409 ms	1148 KiB

miners

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

ll check(vector<char>v){
    int n = v.size() - 1;
    bool M, B, F;
    M = B = F = 0;

    for(int i = 0; i < 3; i++){
        if(v[n - i] == 'M') M = true;
        else if(v[n - i] == 'B') B = true;
        else if(v[n - i] == 'F') F = true;
    }

    return (M + B + F);
}

int main(){
    int n; cin >> n;
    ll ans = 0;
    vector<char>s(n);

    for(int i = 1; i <= n; i++) cin >> s[i];

    vector<char>a, b;
    a.push_back('A');
    a.push_back('A');
    b.push_back('A');
    b.push_back('A');

    for(int i = 1; i <= n; i++){
        bool x, y;
        x = y = false;

        if(s[i] != a.back() && s[i] == b.back()){
            a.push_back(s[i]);
            x = true;
        } else if(s[i] != b.back() && s[i] == a.back()){
            b.push_back(s[i]);
            y = true;
        } else if(s[i] != a.back() && s[i] != b.back()){
            auto it1 = find(s.begin() + i, s.end(), a.back()) - s.begin();
            auto it2 = find(s.begin() + i, s.end(), b.back()) - s.begin();

            if(it1 < it2){
                a.push_back(s[i]);
                x = true;
            }
            else{
                b.push_back(s[i]);
                y = true;
            }
        } else{
            vector<char>tmpa, tmpb;
            tmpa = a;
            tmpb = b;
            tmpa.push_back(s[i]);
            tmpb.push_back(s[i]);

            if(check(tmpa) > check(tmpb)){
                a.push_back(s[i]);
                x = true;
            } else{
                b.push_back(s[i]);
                y = true;
            }
        }

        if(x) ans += check(a);
        else ans += check(b);
    }

    cout << ans << endl;

    return 0;
}

/*
MBF
MFB

*/

• Subtask 1: 9 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 7 / 7
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8