BZOJ 4896 [Thusc2016]补退选 (Trie树维护vector)

题目大意：略

这竟然是$thusc$的题...

先把询问里加入的串全拎出来，建出$Trie$树，$Trie$里每个节点都开一个$vector$记录操作标号，再记录操作数量$sum$

然后瞎**搞搞就行了

又水了一篇博客

 #include <cmath>
 #include <queue>
 #include <vector>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #define N1 100100
 #define N2 6001000
 #define MM 100
 #define ll long long
 #define dd double
 #define uint unsigned int
 #define mod 1000000007
 #define idx(X) (X-'a')
 using namespace std;

 char str[MM];

 struct Trie{
 int ch[N2][],sum[N2],tot;
 vector<int>s[N2];
 void insert(int len)
 {
     int x=;
     for(int i=;i<=len;i++){
         if(!ch[x][idx(str[i])])
             ch[x][idx(str[i])]=++tot;
         x=ch[x][idx(str[i])];
     }
 }
 void add(int len,int id)
 {
     int x=;
     for(int i=;i<=len;i++){
         x=ch[x][idx(str[i])];
         if(sum[x]==s[x].size())
             s[x].push_back(id);
         sum[x]++;
     }
 }
 void sub(int len)
 {
     int x=;
     for(int i=;i<=len;i++){
         x=ch[x][idx(str[i])];
         sum[x]--;
     }
 }
 int query(int len,int w)
 {
     int x=;
     for(int i=;i<=len;i++){
         x=ch[x][idx(str[i])];
         if(!x) return -;
     }
     if(s[x].size()<=w) return -;
     return s[x][w];
 }
 }T;
 int st[N1],ed[N1],p[N1],cnt;
 int A[N1],B[N1],C[N1];
 char Q[N2],tmp[MM];

 int main()
 {
     int n;
     scanf("%d",&n);
     for(int i=;i<=n;i++)
     {
         scanf("%d",&p[i]);
         scanf("%s",str+);
         int len=strlen(str+),j=;
         st[i]=cnt+;
         while(j<=len)
             Q[++cnt]=str[j],j++;
         ed[i]=cnt;
         if(p[i]==){
             T.insert(len);
         }else if(p[i]==){
             scanf("%d%d%d",&A[i],&B[i],&C[i]);
         }
     }
     int ans=,w;
     for(int i=;i<=n;i++)
     {
         for(int j=st[i];j<=ed[i];j++)
             str[j-st[i]+]=Q[j];
         if(p[i]==){
             T.add(ed[i]-st[i]+,i);
         }else if(p[i]==){
             T.sub(ed[i]-st[i]+);
         }else{
             w=(1ll*A[i]*abs(ans)+B[i])%C[i];
             ans=T.query(ed[i]-st[i]+,w);
             printf("%d\n",ans);
         }
     }
     return ;
 }

upd:数据太水了吧..我原来的代码，query函数里的特判是错的= =