Submission #74119619

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;
using ll = long long;
using pll = pair<ll, ll>;
const int inf = 1073741823;
const long long INF = 1LL << 60;
#define el '\n'
#define spa " "
#define pb emplace_back
#define rep(i, s, n) for(int i = (s); i < (int)(n); i++)
#define rrep(i, s, n) for(int i = (int)(n) - 1; i >= (s); i--)
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define unless(c) if(!(c))
#define until(c) while(!(c))

int sub(){
    return 0;
}

int solve() {
    ll n, l, r, ans = 0;
    cin >> n >> l >> r;
    string s;
    cin >> s;
    vector<vector<int>> d((int)'z'-(int)'a'+1);
    int ac = (int)'a';
    rep(i, 0, n){
        d[s[i]-ac].pb(i);
    }
    rep(i, 0, n-r+l){
        int ind = s[i]-ac;
        if(d[ind].size() == 1){
            continue;
        }
        else{
            for(auto x: d[ind]){
                if(l <= x-i and x-i <= r){
                    ans++;
                }
            }
        }
    }
    cout << ans << el;
    return 0;
}

int main() {
    int t = 1;
    // cin >> t;
    rep(i, 0, t) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result