提出 #70613489

---

ソースコード 拡げる

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
using ll = long long;
using db = double;
const ll N = 1e6 + 5;
const ll md = 998244353;
const ll MOD = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db eps = 1e-6;
const db E = 2.718281828459045;
typedef pair<ll, ll> PLL;
#define fi first
#define se second
void solve()
{
    ll n, a, b;
    cin >> n >> a >> b;
    string s;
    cin >> s;
    s = '#' + s;
    vector<ll> pre(n + 1);
    vector<ll> pre2(n + 1);
    for (ll i = 1; i <= n;i++)
    {
        pre[i] = pre[i - 1];
        pre2[i] = pre2[i - 1];
        if(s[i]=='a')
            pre[i]++;
        else
            pre2[i]++;
    }
    ll ans = 0;
    for (ll i = 1; i <= n;i++)
    {
        auto it1 = lower_bound(pre.begin() + i , pre.end(), a + pre[i-1]);
        auto it2 = lower_bound(pre2.begin() + i , pre2.end(), b+pre2[i-1]);

        if(it1!=pre.end())
        {
            ll k1 =  it1-pre.begin();
            ll k2 = it2-pre2.begin();
            // cout << it1 - pre.begin() << ' ' << it2 - pre2.begin() << '\n';
            if(k2>k1)
                ans += k2 - k1;
        }
    }
    cout << ans << '\n';
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    T = 1;
    //cin>>T;
    while (T--)
    {
        solve();
    }
}

提出情報

ジャッジ結果