2555: SubString
Time Limit: 30 Sec Memory Limit: 512 MBSubmit: 4189 Solved: 1284
[Submit][Status][Discuss]
Description
Input
Output
Sample Input
A
QUERY B
ADD BBABBBBAAB
Sample Output
HINT
Source
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 600010
#define pa Fa[x]
#define lc ch[x][0]
#define rc ch[x][1]
using namespace std;
char ss[N];
int Q, n, mask = 0;
inline void getin(int mask) {
scanf("%s", ss); n = strlen(ss);
for(int i = 0; i < n; ++i) mask = (mask * 131 + i) % n, swap(ss[i], ss[mask]);
}
int ch[N<<1][2], Fa[N<<1], w[N<<1], add[N<<1];
inline bool wh(int x) {return ch[pa][1] == x;}
inline bool isr(int x) {return ch[pa][0] != x && ch[pa][1] != x;}
inline void plus(int x, int v) {add[x]+= v; w[x]+= v;}
inline void pushdown(int x) {
if(add[x]) {
if(lc) plus(lc, add[x]);
if(rc) plus(rc, add[x]);
add[x] = 0;
}
}
inline void pd(int x) {if(!isr(x)) pd(pa); pushdown(x);}
inline void rotate(int x) {
int y = Fa[x], z = Fa[y], c = wh(x);
if(!isr(y)) ch[z][wh(y)] = x; Fa[x] = z;
ch[y][c] = ch[x][c^1]; Fa[ch[x][c^1]] = y;
ch[x][c^1] = y; Fa[y] = x;
}
inline void splay(int x) {
pd(x);
for(; !isr(x); rotate(x))
if(!isr(pa)) rotate(wh(pa) == wh(x) ? pa : x);
}
inline void access(int x) {for(int y = 0; x; y = x, x = pa) splay(x), rc = y;}
inline void link(int x, int y) {
Fa[x] = y;
access(y); splay(y); plus(y, w[x]);
}
inline void cut(int x) {
access(x); splay(x); plus(lc, -w[x]);
Fa[lc] = 0; lc = 0;
}
int nxt[N<<1][26], fa[N<<1], mx[N<<1], cnt = 1, last = 1;
inline void extend(int c) {
int np = ++cnt, p = last; mx[np] = mx[last] + 1; last = np;
w[np] = 1;
for(; p && !nxt[p][c]; p = fa[p]) nxt[p][c] = np;
if(!p) fa[np] = 1, link(np, 1);
else {
int q = nxt[p][c];
if(mx[q] == mx[p] + 1) fa[np] = q, link(np, q);
else {
int nq = ++cnt; mx[nq] = mx[p] + 1; fa[nq] = fa[q]; link(nq, fa[nq]); memcpy(nxt[nq], nxt[q], sizeof(nxt[nq]));
for(; p && nxt[p][c] == q; p = fa[p]) nxt[p][c] = nq;
cut(q); fa[q] = fa[np] = nq; link(q, nq); link(np, nq);
}
}
}
inline int query() {
int u = 1;
for(int i = 0; i < n; ++i) {
int c = ss[i] - 'A';
if(nxt[u][c]) u = nxt[u][c];
else return 0;
}
pd(u);
return w[u];
}
int main() {
scanf("%d%s", &Q, ss); n = strlen(ss);
for(int i = 0; i < n; ++i) extend(ss[i] - 'A');
for(int i = 1; i <= Q; ++i) {
char opt[10]; scanf("%s", opt); getin(mask);
if(opt[0] == 'A') for(int j = 0; j < n; ++j) extend(ss[j] - 'A');
else {
int ans = query();
printf("%d\n", ans);
mask^= ans;
}
}
return 0;
}