【HDU 4812】String 哈希 + 尺取

传送门

题意

给你一个串$s$,和$m,l$.问你有多少长度为$m\ast l$的$s$的子串满足该子串由$m$个长度为$l$且个不相同的子串组成的个数.问的是长度为$m\ast l$的子串的个数。

分析

我们先对整个字符串进行哈希处理，然后从$1-l$枚举一个位置作为开头，尺取处理长度为$m\ast l$的子序列即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
char str[N];
ull h[N],base[N];
ull seed = 131;
int m,n,l;

ull hash_string(int l,int r){
	return h[r] - h[l - 1] * base[r - l + 1];
}

int main() {
	base[0] = 1;
	for(int i = 1;i < N;i++) base[i] = base[i - 1] * seed;
	while(~scanf("%d%d",&m,&l)){
		scanf("%s",str + 1);
		n = strlen(str + 1);
		for(int i = 1;i <= n;i++) h[i] = h[i - 1] * 131 + str[i] - 'a';
		ll res = 0;
		for(int i = 1;i <= l && i + m * l - 1 <= n;i++){
			map<ull,int> M;
			int cnt = 0;
			for(int j = i;j < i + l * m;j += l) {
				if(!M[hash_string(j,j + l - 1)]) cnt++;
				M[hash_string(j,j + l - 1)]++;
			}
			if(cnt == m) res++;
			for(int j = i + l * m;j + l  - 1 <=n;j += l){
				if(!M[hash_string(j,j + l - 1)]) cnt++;
				M[hash_string(j,j + l - 1)]++;
				M[hash_string(j - m * l,j - m * l + l - 1)]--;
				if(!M[hash_string(j - m * l,j - m * l + l - 1)]) cnt--;
				if(cnt == m) res++;
			}
		}
		dl(res);
	}

}