提出 #70610428

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))

typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};

template <class T>
inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int N, A, B;
string S;

signed main() {
    cin >> N >> A >> B;
    cin >> S;
    vector<int> X(N + 1, 0), Y(N + 1, 0);
    for (int i = 0; i < N; ++i) {
        X[i + 1] = X[i];
        Y[i + 1] = Y[i];
        if (S[i] == 'a') {
            X[i + 1]++;
        } else {
            Y[i + 1]++;
        }
    }
    // for (int i = 0; i < N; ++i) {
    //     cout << X[i] << " " << Y[i] << endl;
    // }
    int ans = 0;
    for (int i = 0; i < N; ++i) {
        // cout << "i: " << i << endl;
        auto itr_a = lower_bound(X.begin() + i + 1, X.end(), A + X[i]);
        if (itr_a != X.end()) {
            auto itr_b = lower_bound(Y.begin() + i + 1, Y.end(), B + Y[i]);
            int idx_a = itr_a - X.begin();
            int idx_b = itr_b - Y.begin();
            chmin(idx_a, N + 1);
            chmin(idx_b, N + 1);
            // cout << "idx_a: " << idx_a << endl;
            // cout << "idx_b: " << idx_b << endl;
            if (idx_a < idx_b) {
                ans += idx_b - idx_a;
            }
        }
    }
    cout << ans << endl;
}

提出情報

ジャッジ結果