Submission #74100453

---

Source Code Expand

#include <bits/stdc++.h>

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, L, R; std::string S;
    std::cin >> N >> L >> R >> S;
    std::unordered_map<char, std::vector<int> > cpos;
    for (int i = 0; i < N; i++) cpos[S[i]].push_back(i);
    long long ans = 0;
    for (const auto& pair : cpos) {
        const std::vector<int>& pos = pair.second;
        int k = pos.size();
        for (int m = 0; m < k; m++) {
            int curw = pos[m];
            int tl = curw + L;
            int rH = curw + R;
            auto vc = lower_bound(pos.begin(), pos.end(), tl);
            int low = vc - pos.begin();
            auto hII = upper_bound(pos.begin(), pos.end(), rH);
            int high = hII - pos.begin() - 1;
            int vl = std::max(low, m + 1);
            if (vl <= high) ans += high - vl + 1;
        }
    }
    std::cout << ans;
    return 0;
}

Submission Info

Judge Result