【字符串hash】 codeforces 471D MUH and Cube Walls

这道题好像第25组数据会卡掉对64位取模的hash函数。。。改成对大素数取模就过了。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 300005
#define eps 1e-10
#define mod 1000000007
#define INF 1e17
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

const int x = 131;
LL hash[maxn], xp[maxn];
int a[maxn], b[maxn];
int n, m;

void read(void)
{
	scanf("%d%d", &n, &m);
	for(int i = 0; i < n; i++) scanf("%d", &a[i]);
	for(int i = 0; i < m; i++) scanf("%d", &b[i]);
}

inline LL H(int now, int L)
{
	return ((hash[now] - hash[now + L] * xp[L] % mod) % mod + mod) % mod;
}

void work(void)
{
	LL t, tt, t1;
	int ans = 0, t2 = n - m;
	xp[0] = 1, t = tt = 0, hash[n] = 0;
	for(int i = 1; i <= n; i++) xp[i] = xp[i-1] * x % mod;
	for(int i = n-1; i >= 0; i--) hash[i] = (hash[i+1] * x % mod + a[i]) % mod;
	for(int i = m-1; i >= 0; i--) t = (t * x % mod + b[i]) % mod;
	for(int i = m-1; i >= 0; i--) tt = (tt + xp[i]) % mod;
	for(int i = 0; i <= t2; i++) {
		t1 = ((H(i, m) - (a[i] - b[0]) * tt % mod) % mod + mod) % mod;
		if(t1 == t) ans++;
	}
	printf("%d\n", ans);
}

int main(void)
{
	read();
	work();
	return 0;
}