提出 #70627638

---

ソースコード 拡げる

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <tuple>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using ll = long long;
using ld = long double;
using namespace std;
#define endl "\n";
#define ff first
#define ss second

#define forn(i,n) for(int i=0;i<n;i++)
#define dbgv(v) cout<<#v<<" "<<v<<endl
#define dbga(a,n) forn(i,n-1) {cout<<a[i]<<' ';} cout<<a[n-1]<<'\n';
#define all(v) (v).begin(), (v).end()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int N, A, B;
    if (!(cin >> N >> A >> B)) return 0;
    string S;
    cin >> S;

    
    vector<int> pa(N+1, 0), pb(N+1, 0);
    for (int i = 0; i < N; ++i) {
        pa[i+1] = pa[i] + (S[i] == 'a');
        pb[i+1] = pb[i] + (S[i] == 'b');
    }

    ll ans = 0;
    for (int l = 1; l <= N; ++l) {
        
        int needA = pa[l-1] + A;
        auto itA = lower_bound(pa.begin() + l, pa.end(), needA);
        if (itA == pa.end()) continue;
        int f = int(itA - pa.begin()); 

        
        int maxB = pb[l-1] + (B - 1);
        
        auto itB = upper_bound(pb.begin() + l, pb.end(), maxB);
        int g = int(itB - pb.begin()) - 1; 

        if (g >= f) ans += (g - f + 1);
    }

    cout << ans << "\n";
    return 0;
}

提出情報

ジャッジ結果