Submission #74109628

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

void solve(void) {
    int n, l, r;
    cin >> n >> l >> r;
    string s;
    cin >> s;
    vector chidx(26, vector<int>());
    for (int i = 0; const auto& c : s) {
        chidx[c - 'a'].push_back(i);
        i++;
    }

    long ans = 0;

    for (const auto& c : chidx) {
        int len = c.size();
        if (len == 0) {
            continue;
        }

        for (int i = 0; i < len; i++) {
            auto left = ranges::lower_bound(c, c[i] + l);
            auto right = ranges::upper_bound(c, c[i] + r);
            ans += distance(left, right);
        }
    }

    cout << ans << endl;
}

int main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}

Submission Info

Judge Result