hdu-4821 String

一道水题，做不出来是我菜了

不熟悉字符串Hash

hash主要有两个用处

1.建立字符串到int的映射

2.特异化(确定)一个字符串

本题属于下一种

https://vjudge.net/problem/HDU-4821

写这篇主要是为了让自己记住教训

附：代码

/Info/
//Problem:
//Date:
//Skill:
//Bug:
/Definations/
//循环控制
#define CLR(a) memset((a),0,sizeof(a))
#define F(i,a,b) for(int i=a;i<=int(b);++i)
#define F2(i,a,b) for(int i=a;i>=int(b);--i)
#define RE(i,n)  for(int i=0;i<int(n);i++)
#define RE2(i,n) for(int i=1;i<=int(n);i++)
//简化敲击
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<long long ,long long>
#define PB push_back
#define MODY(n) (n%=mod)<0?n+=mod:n
#define MODED(n) ((n)<0?(n)%mod+mod:(n)%mod)
#define x first
#define y second
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const long long llinf = 0x3f3f3f3f3f3f3f3f;
Options//
#define stdcpph
#define CPP_IO

#ifdef stdcpph
#include<bits/stdc++.h>
#else
#include<ctype.h>
#include<string.h>
#include<math.h>
#include<vector>
#include<map>
#include<algorithm>
#include<functional>
#ifdef CPP_IO
#include<iostream>
#include<iomanip>
#include<string>
#else
#include<stdio.h>
#endif
#endif
Basic Functions//
template<typename INint> inline void IN(INint &x)
{
	x = 0; int f = 1; char c; cin.get(c);
	while (c<'0' || c>'9') { if (c == '-')f = -1; cin.get(c); }
	while (c >= '0'&&c <= '9') { x = x * 10 + c - '0'; cin.get(c); }
	x *= f;
}
template<typename INint> inline void OUT(INint x)
{
	if (x > 9)OUT(x / 10); cout.put(x % 10 + '0');
}
Added Functions//
const int maxn = int(3e5+8);
typedef unsigned long long ull;
map<ull, int>cnt;

///
ull R[maxn], base[maxn];
const int seed = 31;
void init()
{
	base[0] = 1;F(i, 1, maxn - 1)base[i] = base[i-1] * seed;
}
void initHash(const char*st, int len)
{
	R[len] = 0; for (int i = len - 1; i >= 0; --i)R[i] = R[i + 1] * seed + st[i] - 'a';
}
//获取[st,en)内的hash值
ull GetHash(int st, int en)
{
	return R[st]-R[en] * base[en - st];
}
///
int m, l; string s;
Code/
int main()
{
	//freopen("C:\\Users\\VULCAN\\Desktop\\data.in", "r", stdin);
	int T(1), times(0);
#ifdef CPP_IO// CPP_IO
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	//cin >> T;
#else
	//IN(T);
#endif 
	/
	init();
	while (++times, T--, cin >> m >> l >> s)
	{
		initHash(s.c_str(), s.size());
		ll ans(0);
		for (int i = 0; i < l&&i + m * l <= s.size(); ++i)
		{
			cnt.clear();
			for (int j = i; j<i+m*l; j += l)cnt[GetHash(j,j+l)]++;
			if (cnt.size() == m)++ans;

			for (int j = i + l; j + m * l <= s.size(); j += l)
			{
				ull val = GetHash(j - l, j);
				cnt[val]--;
				if (cnt[val]==0)cnt.erase(val);
				cnt[GetHash(j+m*l-l,j+m*l)]++;
				if (cnt.size() == m)++ans;
			}
		}
		cout << ans << '\n';
	}
	///
	return 0;
}
//What to Debug
/*
-1.最好把全部warning都X掉,否则:https://vjudge.net/solution/19887176
0.看看自己是否有可能需要快读，禁endl
1.数组越界，爆int,浮点精度(查看精度是否达到题目要求,看有没有浮点数比较:eps)，取模操作，初始化数组，边缘数据
2.通读代码，代码无逻辑错误
3.读题，找到题意理解失误或算法错误
4.放弃
*/