Submission #70667865

---

Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;

int main(){
    int n,a,b;
    cin >> n >> a >> b;
    string s;
    cin >> s;

    vector<int> cntA(n+1, 0), cntB(n+1, 0);
    for(int i = 0; i < n; i++){
        cntA[i+1] = cntA[i];
        cntB[i+1] = cntB[i];

        if(s[i] == 'a') cntA[i+1]++;
        else            cntB[i+1]++;
    }

    // for(int i = 0; i < n+1; i++) cout << cntA[i] << " ";
    // cout << endl;
    // for(int i = 0; i < n+1; i++) cout << cntB[i] << " ";
    // cout << endl;

    ll ans = 0;
    for(int i = 0; i < n; i++){
        int idx1 = distance(cntA.begin(), lower_bound(cntA.begin(), cntA.end(), a + cntA[i]));
        int idx2 = distance(cntB.begin(), lower_bound(cntB.begin(), cntB.end(), b + cntB[i]));
        // cout << idx1 << " " << idx2 << endl;
        ans += max(0, idx2 - idx1);
    }

    cout << ans << endl;
}

Submission Info

Judge Result