【bzoj3916】 Baltic2014 friends hash

非常裸的hash，不过是第一次写hash，比较手生，看到WA了以后，果断改成双关键字，最后才发现原来是possible拼错了。。。还要考虑一种情况，比如ABBAABA，去掉第一个或者第二个B都可以，但是S是一样的。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#define maxn 2001000
#define base1 23333
#define base2 233

using namespace std;

char s[maxn];
unsigned long long hash1[maxn],power1[maxn],h1,h2,hash2[maxn],power2[maxn];
int n,ans,num,mid;

unsigned long long gethash1(int l,int r)
{
	return hash1[r]-hash1[l-1]*power1[r-l+1];
}

unsigned long long gethash2(int l,int r)
{
	return hash2[r]-hash2[l-1]*power2[r-l+1];
}

bool check(int x)
{
	unsigned long long l1,r1,l2,r2;
	if (x<mid)
	{
		l1=gethash1(1,x-1)*power1[mid-x]+gethash1(x+1,mid);
		r1=gethash1(mid+1,n);
		l2=gethash2(1,x-1)*power2[mid-x]+gethash2(x+1,mid);
		r2=gethash2(mid+1,n);
	}
	if (x==mid)
	{
		l1=gethash1(1,x-1);l2=gethash2(1,x-1);
		r1=gethash1(x+1,n);r2=gethash2(x+1,n);
	}
	if (x>mid)
	{
		l1=gethash1(1,mid-1);
		r1=gethash1(mid,x-1)*power1[n-x]+gethash1(x+1,n);
		l2=gethash2(1,mid-1);
		r2=gethash2(mid,x-1)*power2[n-x]+gethash2(x+1,n);
	}
	if (l1==r1 && l2==r2)
	{
		if (l1==h1 && l2==h2) return 0;
		ans=x;h1=l1;h2=l2;
		return 1;
	}
	return 0;
}

void print()
{
	if (ans<mid) for (int i=mid+1;i<=n;i++) printf("%c",s[i]);
	if (ans==mid) for (int i=1;i<mid;i++) printf("%c",s[i]);
	if (ans>mid) for (int i=1;i<mid;i++) printf("%c",s[i]);
	printf("\n");
}

int main()
{
	scanf("%d",&n);
	if (n%2==0) {printf("NOT POSSIBLE\n");return 0;}
	scanf("%s",s+1);mid=n/2+1;
	for (int i=1;i<=n;i++) hash1[i]=hash1[i-1]*base1+s[i];
	power1[0]=1;
	for (int i=1;i<=n;i++) power1[i]=power1[i-1]*base1;
	for (int i=1;i<=n;i++) hash2[i]=hash2[i-1]*base2+s[i];
	power2[0]=1;
	for (int i=1;i<=n;i++) power2[i]=power2[i-1]*base2;
	for (int i=1;i<=n;i++)
	{
		num+=check(i);
		if (num>1) break;
	}
	if (!num) printf("NOT POSSIBLE\n");
	if (num==1) print();
	if (num>1) printf("NOT UNIQUE\n");
	return 0;
}