【BZOJ3207】花神的嘲讽计划I 可持久化线段树/莫队

 1 #include<bits/stdc++.h>
 2 #define ll long long
 3 #define uint unsigned int
 4 #define ull unsigned long long
 5 #define inf 4294967295
 6 #define N 100005 
 7 #define M 100005
 8 #define base 100003
 9 using namespace std;
10 inline int read(){
11   int x=0,f=1;char ch=getchar();
12   while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
13   while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
14   return x*f;
15 }
16 int rt[N],n,m,k,tot,ls[M*40],rs[M*40],sz[M*40];
17 uint hash[N],bas;
18 void add(int pre,int &x,uint l,uint r,uint pos){
19   x=++tot;ls[x]=ls[pre],rs[x]=rs[pre];sz[x]=sz[pre]+1;
20   if(l==r)return;
21   uint mid=l/2+r/2;if((l&1)&&(r&1))mid++; 
22   if(pos<=mid)add(ls[pre],ls[x],l,mid,pos);
23   else add(rs[pre],rs[x],mid+1,r,pos);
24 }
25 int query(int L,int R,uint l,uint r,uint pos){
26   if(l==r)return sz[R]-sz[L];
27   uint mid=l/2+r/2;if((l&1)&&(r&1))mid++;
28   if(pos<=mid)query(ls[L],ls[R],l,mid,pos);
29   else query(rs[L],rs[R],mid+1,r,pos);
30 }
31 int main(){
32   n=read();m=read();k=read();
33   hash[0]=0;
34   for(int i=1;i<=n;i++)hash[i]=hash[i-1]*base+(uint)read();
35   bas=1;
36   for(int i=1;i<=k;i++)bas*=base;
37   for(int i=1;i<=n-k+1;i++)add(rt[i-1],rt[i],1,inf,hash[i+k-1]-hash[i-1]*bas);
38   while(m--){
39     int x=read(),y=read();
40     uint ha=0;
41     for(int i=1;i<=k;i++)ha=ha*base+(uint)read();
42     query(rt[x-1],rt[y-k+1],1,inf,ha)?puts("No"):puts("Yes"); 
43   }
44   return 0;
45 }

 1 #include<bits/stdc++.h>
 2 #define ll long long
 3 #define N 100005
 4 #define base 100003
 5 using namespace std;
 6 inline int read(){
 7   int x=0,f=1;char ch=getchar();
 8   while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
 9   while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
10   return x*f;
11 }
12 int n,m,k,a[N],tot,pos[N],cnt[N];
13 bool ans[N];
14 ll hash[N],h[N],bas;
15 struct Node{
16   int l,r,v,id;
17 }q[N];
18 bool cmp(Node a,Node b){
19   if(pos[a.l]==pos[b.l])return a.r<b.r;
20   else return a.l<b.l;
21 }
22 bool find(int x){
23   if(x==-1)return 0;
24   return cnt[x]?1:0;
25 }
26 int main(){
27   n=read();m=read();k=read();
28   for(int i=1;i<=n;i++)hash[i]=hash[i-1]*base+(ll)read();
29   bas=1;
30   for(int i=1;i<=k;i++)bas*=base;
31   for(int i=1;i<=n-k+1;i++)h[++tot]=hash[i+k-1]-hash[i-1]*bas;
32   sort(h+1,h+1+tot);
33   for(int i=1;i<=n-k+1;i++)a[i]=lower_bound(h+1,h+1+tot,hash[i+k-1]-hash[i-1]*bas)-h;
34   int block=sqrt(n);
35   for(int i=1;i<=n;i++)pos[i]=(i-1)/block+1;
36   for(int i=1;i<=m;i++){
37     int x=read(),y=read();y=y-k+1;
38     ll tmp=0;
39     for(int j=1;j<=k;j++)tmp=tmp*base+(ll)read();
40     int t=lower_bound(h+1,h+1+tot,tmp)-h;
41     if(t>n||h[t]!=tmp)t=-1;
42     q[i].l=x,q[i].r=y;q[i].id=i;q[i].v=t;
43   }
44   sort(q+1,q+1+m,cmp);
45   int ql=1,qr=0;
46   for(int i=1;i<=m;i++){
47     while(qr<q[i].r)cnt[a[++qr]]++;
48     while(ql>q[i].l)cnt[a[--ql]]++;
49     while(qr>q[i].r)cnt[a[qr--]]--;
50     while(ql<q[i].l)cnt[a[ql++]]--;
51     ans[q[i].id]=find(q[i].v);
52   }
53   for(int i=1;i<=m;i++)puts(ans[i]?"No":"Yes");
54   return 0;
55 }