题意:给出两组钟上的位置,问能否通过调整使得在一个时间上
思路:之前写过一个KMP的,维护差值即可,用hash的话一样枚举其中一个的位置,然后判断hash值是否相等
#include <map>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3fll;
const int maxn=201010;
const ll mod=1e9+7;
ll Hash_a[maxn],base[maxn],p=133331,Hash_b[maxn],A[maxn],B[maxn];
ll a[maxn],b[maxn];
ll calc_hash(ll tmp[],int l,int r){return (tmp[r]-tmp[l-1]*base[r-l+1]%mod+mod)%mod;}
int main(){
base[0]=1;for(int i=1;i<maxn;i++) base[i]=base[i-1]*p%mod;
int n;
while(scanf("%d",&n)!=-1){
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
for(int i=1;i<=n;i++) scanf("%lld",&b[i]);
sort(a+1,a+1+n);sort(b+1,b+1+n);
a[n+1]=a[1];b[n+1]=b[1];
for(int i=1;i<=n;i++){ A[i]=a[i+1]-a[i];if(A[i]<0) A[i]+=360000;}
for(int i=1;i<=n;i++){ B[i]=b[i+1]-b[i];if(B[i]<0) B[i]+=360000;}
Hash_a[0]=Hash_b[0]=1;
for(int i=1;i<=n;i++) Hash_a[i]=(Hash_a[i-1]*p%mod+A[i])%mod;
for(int i=1;i<=n;i++) Hash_b[i]=(Hash_b[i-1]*p%mod+B[i])%mod;
int flag=0;
if(calc_hash(Hash_a,1,n)==calc_hash(Hash_b,1,n)) flag=1;
for(int i=2;i<=n;i++){
if(flag) break;
int len=n-i;
if(calc_hash(Hash_a,1,len+1)==calc_hash(Hash_b,i,n)&&calc_hash(Hash_a,len+2,n)==calc_hash(Hash_b,1,i-1)) flag=1;
}
if(flag) printf("possible\n");
else printf("impossible\n");
}
return 0;
}