Submission #74105805

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,char> pic;
typedef vector<int> vi;
typedef vector<ll> vll;
#define SZ(x) ((int)x.size())
ll ksm(ll a,ll b,ll p){if (p == 1)return 0;if (b == 0)return 1%p;
ll ans = 1;	a %= p;while (b > 0){if (b&1){ans = ans*a%p;}a = (a*a)
%p;b >>= 1;}return ans;}
const int mod = 1e9+7;
const int P = 998244353;
const ll inf = (1LL << 50LL);
const ll N = 1010;

int n,l,r;
ll ans = 0;
char s[500010];
int table[200][500010];
int main(){
	scanf("%d%d%d",&n,&l,&r);
	scanf("%s",s+1);
	for (int i = 1;i <= n;i++){
		for (int j = 'a';j <= 'z';j++){
			if (s[i] == j){
				table[j][i] = table[j][i-1]+1;
			}
			else {
				table[j][i] = table[j][i-1];
			}
		}
	}
	for (int i = 'a';i <= 'z';i++){
		int a = 1,b = 1,c = 1;
		for (;a <= n;a++){
			if (s[a] != i){
				continue;
			}
			b = a+l;
			if (b > n){
				break;
			}
			c = min(a+r,n);
			ans += table[i][c]-table[i][b-1];
			//printf("%c %d %d %d %d\n",i,ans,a,b,c);
		}
	}
	printf("%lld",ans);

		
    return 0;
}

Submission Info

Judge Result