bzoj 1014 火星人prefix - 链表 - 分块

  1 /**
  2  * bzoj
  3  * Problem#1014
  4  * Accepted
  5  * Time: 3972ms
  6  * Memory: 3824k 
  7  */ 
  8 #include <bits/stdc++.h>
  9 using namespace std;
 10 typedef bool boolean;
 11 
 12 const int cs = 350; 
 13 const int base = 200379;
 14 int powb[100005];
 15         
 16 typedef class Chunk {
 17     public:
 18         Chunk *suf;
 19         int s;
 20         char str[cs + 5];
 21         int psh[cs + 5];
 22         int ssh[cs + 5];
 23         
 24         Chunk():suf(NULL), s(0) {    }
 25         Chunk(Chunk* org, int s):suf(org), s(s) {        }
 26         
 27         static Chunk* alloc();
 28         
 29         void maintain() {
 30             psh[0] = ssh[s + 1] = 0;
 31             for(int i = 1; i <= s; i++)
 32                 psh[i] = psh[i - 1] + str[i] * powb[i - 1];
 33             for(int i = s; i; i--)
 34                 ssh[i] = ssh[i + 1] * base + str[i];
 35         }
 36         
 37         void insert(int p, char x) {
 38             for(int i = s + 1; i > p; i--)
 39                 str[i] = str[i - 1];
 40             str[p] = x;
 41             if(full()) {
 42                 Chunk* nc = suf;
 43                 if(suf->full()) {
 44                     nc = alloc();
 45                     nc->suf = suf;
 46                     suf = nc;
 47                 }
 48                 nc->insert(1, str[s + 1]);
 49             } else s++;
 50             if(p <= s)
 51                 maintain();
 52         }
 53         
 54         void modify(int p, char x) {
 55             str[p] = x;
 56             maintain();
 57         }
 58         
 59         boolean full() {
 60             return s == cs;
 61         }
 62 }Chunk;
 63 
 64 Chunk pool[650];
 65 Chunk *top = pool;
 66 
 67  Chunk* Chunk::alloc() {
 68     return top++;
 69 }
 70 
 71 typedef pair<Chunk*, int> pci;
 72 #define fi first
 73 #define sc second
 74 
 75 int m;
 76 Chunk nsta = Chunk(&nsta, cs), nend = Chunk(&nend, cs);
 77 char str[100005]; 
 78 
 79 inline void init() {
 80     nsta.suf = &nend;
 81     powb[0] = 1;
 82     for(int i = 1; i <= 100002; i++)
 83         powb[i] = powb[i - 1] * base;
 84     memset(nend.psh, -1, sizeof(nend.psh));
 85     
 86     gets(str + 1);
 87     scanf("%d", &m);
 88     
 89     int fin = 1;
 90     Chunk* pc = &nsta, *nc;
 91     while(str[fin]) {
 92         nc = Chunk::alloc();
 93         nc->suf = pc->suf;
 94         pc->suf = nc;
 95         for(nc->s = 0; str[fin] && nc->s < cs; )
 96             nc->str[++nc->s] = str[fin++];
 97         nc->maintain();
 98         pc = nc;
 99     }
100 }
101 
102 pci findc(int pos) {
103     int skip = 0;
104     pci rt(nsta.suf, 0);
105     while(skip + rt.fi->s < pos) {
106         skip += rt.fi->s;
107         rt.fi = rt.fi->suf;
108     }
109     rt.sc = pos - skip;
110     return rt;
111 }
112 
113 int getHash(pci p, pci& nxt) {
114     int skip = 0, rt = 0;
115     rt = p.fi->ssh[p.sc];
116     skip = p.fi->s - p.sc + 1;
117     p.fi = p.fi->suf;
118     while(skip + p.fi->s < cs) {
119         rt += powb[skip] * p.fi->psh[p.fi->s];
120         skip += p.fi->s;
121         p.fi = p.fi->suf;
122     }
123     nxt = pci(p.fi, cs - skip + 1);
124     if(nxt.sc > nxt.fi->s) {
125         nxt.sc -= nxt.fi->s;
126         nxt.fi = nxt.fi->suf;
127     }
128     rt += powb[skip] * p.fi->psh[cs - skip];
129     return rt;
130 }
131 
132 void getnext(pci &p) {
133     if(p.sc == p.fi->s)
134         p.sc = 1, p.fi = p.fi->suf;
135     else
136         p.sc++;
137 }
138 
139 void debugout() {
140     Chunk* p = nsta.suf;
141     while(p != &nend) {
142         puts(p->str + 1);
143         p = p->suf;
144     }
145 }
146 
147 inline void solve() {
148     char buf[5];
149     int x, y, rt;
150     pci p1, p2, pn1, pn2;
151 //    debugout();
152     while(m--) {
153         scanf("%s%d", buf, &x);
154         if(buf[0] == ‘Q‘) {
155             scanf("%d", &y);
156             if(x != y) {
157                 rt = 0, p1 = findc(x), p2 = findc(y);
158                 while(getHash(p1, pn1) == getHash(p2, pn2))    p1 = pn1, p2 = pn2, rt += cs;
159                 while(p1.fi->str[p1.sc] == p2.fi->str[p2.sc]) {
160                     getnext(p1);
161                     getnext(p2);
162                     rt++;
163                 }
164             } else {
165                 p1 = findc(x);
166                 rt = p1.fi->s - p1.sc + 1;
167                 p1.fi = p1.fi->suf;
168                 while(p1.fi != &nend) {
169                     rt += p1.fi->s;
170                     p1.fi = p1.fi->suf;
171                 }
172             }
173             printf("%d\n", rt);
174         } else if(buf[0] == ‘R‘) {
175             scanf("%s", buf);
176             p1 = findc(x);
177             p1.fi->modify(p1.sc, buf[0]);
178         } else {
179             scanf("%s", buf);
180             p2 = p1 = findc(x);
181             getnext(p1);
182             if(p1.fi != &nend)
183                 p1.fi->insert(p1.sc, buf[0]);
184             else
185                 p2.fi->insert(p2.sc + 1, buf[0]);
186         }
187     }
188 }
189 
190 int main() {
191     init();
192     solve();
193     return 0;
194 }