Submission #73697705

---

Source Code Expand

#include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, n) for(int  i = 0; i < (n); ++i)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
int gcd(int a, int b){
    if(b == 0) return a;  
    else return gcd(b, a%b);
}
struct Compare {
    bool operator()(const pair<ll, int>& a, const pair<ll, int>& b) {
        return a.first > b.first;  
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string s; cin >> s;
    set<int> a,b,c;
    rep(i,(int)s.size()){
        if(s[i] == 'A') a.insert(i);
        if(s[i] == 'B') b.insert(i);
        if(s[i] == 'C') c.insert(i);
    }
    int ans = 0;
    for(auto x:a){
        auto it = b.lower_bound(x);
        if(it == b.end()) break;
        int num = *it;
        auto it2 = c.lower_bound(num);
        if(it2 == c.end()) break;
        ans++;
        b.erase(it);
        c.erase(it2);
    }
    cout << ans <<  endl;
}

Submission Info

Judge Result