bzoj4896 [Thu Summer Camp2016]补退选

 1 #include <bits/stdc++.h>
 2 #define il inline
 3 #define RG register
 4 #define ll long long
 5 #define N (100010)
 6 
 7 using namespace std;
 8 
 9 int ch[60*N][10],sum[60*N],val[60*N],rt[N],n,sz,len,ans;
10 char s[110];
11 
12 il int gi(){
13   RG int x=0,q=1; RG char ch=getchar();
14   while ((ch<‘0‘ || ch>‘9‘) && ch!=‘-‘) ch=getchar();
15   if (ch==‘-‘) q=-1,ch=getchar();
16   while (ch>=‘0‘ && ch<=‘9‘) x=x*10+ch-48,ch=getchar();
17   return q*x;
18 }
19 
20 il void insert(RG int x,RG int &y,char *s,RG int len,RG int v){
21   val[y=++sz]=val[x]+v,sum[y]=max(sum[x],val[y]); RG int now=y;
22   for (RG int i=1,a,b;i<=len;++i){
23     for (RG int j=0;j<10;++j) ch[now][j]=ch[x][j];
24     a=ch[x][s[i]-‘a‘],b=ch[now][s[i]-‘a‘]=++sz;
25     val[b]=val[a]+v,sum[b]=max(sum[a],val[b]),x=a,now=b;
26   }
27   return;
28 }
29 
30 il int query(RG int x,char *s,RG int len){
31   for (RG int i=1;i<=len;++i) x=ch[x][s[i]-‘a‘];
32   return sum[x];
33 }
34 
35 il int find(RG int id,char *s,RG int len,RG int lim){
36   RG int l=1,r=id,mid,ans=-1;
37   while (l<=r){
38     mid=(l+r)>>1;
39     if (query(rt[mid],s,len)>lim) ans=mid,r=mid-1; else l=mid+1;
40   }
41   return ans;
42 }
43 
44 int main(){
45 #ifndef ONLINE_JUDGE
46   freopen("trie.in","r",stdin);
47   freopen("trie.out","w",stdout);
48 #endif
49   n=gi();
50   for (RG int i=1,a,b,c;i<=n;++i){
51     RG int op=gi(); scanf("%s",s+1),len=strlen(s+1);
52     if (op<=2) insert(rt[i-1],rt[i],s,len,op==1 ? 1 : -1); else{
53       a=gi(),b=gi(),c=gi(),ans=(1LL*a*abs(ans)+b)%c;
54       rt[i]=rt[i-1],ans=find(i,s,len,ans),printf("%d\n",ans);
55     }
56   }
57   return 0;
58 }