HDU - 6054 sa + 树状数组套线段树

因为强制在线所以只能转成序列上的问题然后树套树了。。。

#include<bits/stdc++.h>
#define LL long long
#define LD long double
#define ull unsigned long long
#define fi first
#define se second
#define mk make_pair
#define PLL pair<LL, LL>
#define PLI pair<LL, int>
#define PII pair<int, int>
#define SZ(x) ((int)x.size())
#define ALL(x) (x).begin(), (x).end()
#define fio ios::sync_with_stdio(false); cin.tie(0);

using namespace std;

const int N = 2e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + ;
const double eps = 1e-;
const double PI = acos(-);

template<class T, class S> inline void add(T& a, S b) {a += b; if(a >= mod) a -= mod;}
template<class T, class S> inline void sub(T& a, S b) {a -= b; if(a < ) a += mod;}
template<class T, class S> inline bool chkmax(T& a, S b) {return a < b ? a = b, true : false;}
template<class T, class S> inline bool chkmin(T& a, S b) {return a > b ? a = b, true : false;}

int r[N], sa[N], _t[N], _t2[N], c[N], rk[N], lcp[N], san;

void buildSa(int *r, int n, int m) {
    int i, j = , k = , *x = _t, *y = _t2;
    for(i = ; i < m; i++) c[i] = ;
    for(i = ; i < n; i++) c[x[i] = r[i]]++;
    for(i = ; i < m; i++) c[i] += c[i - ];
    for(i = n - ; i >= ; i--) sa[--c[x[i]]] = i;
    for(int k = ; k <= n; k <<= ) {
        int p = ;
        for(i = n - k; i < n; i++) y[p++] = i;
        for(i = ; i < n; i++) if(sa[i] >= k) y[p++] = sa[i] - k;
        for(i = ; i < m; i++) c[i] = ;
        for(i = ; i < n; i++) c[x[y[i]]]++;
        for(i = ; i < m; i++) c[i] += c[i - ];
        for(i = n - ; i >= ; i--) sa[--c[x[y[i]]]] = y[i];
        swap(x, y);
        p = ; x[sa[]] = ;
        for(int i = ; i < n; i++) {
            if(y[sa[i - ]] == y[sa[i]] && y[sa[i - ] + k] == y[sa[i] + k])
                x[sa[i]] = p - ;
            else x[sa[i]] = p++;
        }
        if(p >= n) break;
        m = p;
     }
     for(i = ; i < n; i++) rk[sa[i]] = i;
     for(i = ; i < n - ; i++) {
        if(k) k--;
        j = sa[rk[i] - ];
        while(r[i + k] == r[j + k]) k++;
        lcp[rk[i]] = k;
     }
}

struct bit_seg {
    int Rt[N], ls[N * ], rs[N * ], sum[N * ], tot, n, maxval;
    void init(int _n, int _maxval) {
        n = _n; maxval = _maxval;
        for(int i = ; i <= tot; i++)
            sum[i] = ls[i] = rs[i] = ;
        for(int i = ; i <= n; i++) Rt[i] = ;
        tot = ;
    }
    void update(int& o, int pos, int v, int l, int r) {
        if(!o) o = ++tot;
        sum[o] += v;
        if(l == r)return ;
        int m = l + r >> ;
        if(pos <= m) update(ls[o], pos, v, l, m);
        else update(rs[o], pos, v, m + , r);
    }
    int query(int o, int L, int R, int l, int r) {
        if(L > R || l > r || !o) return ;
        if(R < l || r < L) return ;
        if(L <= l && r <= R) return sum[o];
        int m = l + r >> ;
        return query(ls[o] , L , R , l , m) + query(rs[o], L, R, m + , r);
    }
    int bitquery(int L, int R, int a, int b) {
        int ans = ;
        for(int i = R; i; i -= i & -i) ans += query(Rt[i], a, b, , maxval);
        for(int i = L - ; i; i -= i & -i) ans -= query(Rt[i], a, b, , maxval);
        return ans;
    }
    void bitupdate(int i,int pos,int v) {
        for( ; i <= n; i += i & -i) update(Rt[i], pos, v, , maxval);
    }
} S;

int Log[N];

struct ST {
    int dp[N][], ty;
    void build(int n, int b[], int _ty) {
        ty = _ty;
        for(int i = ; i <= n; i++) dp[i][] = ty * b[i];
        for(int j = ; j <= Log[n]; j++)
            for(int i = ; i + ( << j) -  <= n; i++)
                dp[i][j] = max(dp[i][j - ], dp[i + ( << (j - ))][j - ]);
    }
    int query(int x, int y) {
        int k = Log[y - x + ];
        return ty * max(dp[x][k], dp[y - ( << k) + ][k]);
    }
} rmq;

bool is[N];
char s[N], t[N];
int f[N], q;

int main() {
    for(int i = -(Log[]=-); i < N; i++)
        Log[i] = Log[i - ] + ((i & (i - )) == );
    int T; scanf("%d", &T);
    while(T--) {
        san = ;
        scanf("%s%s", s, t);
        int lens = strlen(s), lent = strlen(t);
        reverse(s, s + lens);
        reverse(t, t + lent);
        for(int i = ; i < lens; i++) scanf("%d", &f[i]);
        reverse(f, f + lens);
        for(int i = ; i < lens; i++) {
            is[san] = true;
            r[san++] = s[i];
        }
        is[san] = false; r[san++] = '$';
        for(int i = ; i < lent; i++) {
            is[san] = false;
            r[san++] = t[i];
        }
        is[san] = false; r[san] = ;
        S.init(san, lens - );
        buildSa(r, san + , );
        rmq.build(san, lcp, -);
        for(int i = ; i <= san; i++)
            if(is[sa[i]]) S.bitupdate(i, sa[i], f[sa[i]]);
        scanf("%d", &q);
        int a = , b = , c = , d = , add = , ans = , len = ;
        int low = , high = , mid, L = , R = ;
        while(q--) {
            int op; scanf("%d", &op);
            if(op == ) {
                scanf("%d%d", &a, &b);
                a ^= ans; b ^= ans;
                a = lens - a - ;
                if(a >= lens) {
                    return ;
                }
                add = b - f[a];
                f[a] = b;
                S.bitupdate(rk[a], a, add);
            } else {
                scanf("%d%d%d%d", &c, &d, &a, &b);
                a ^= ans; b ^= ans; c ^= ans; d ^= ans;
                a = lens - a - ;
                b = lens - b - ;
                c = lent - c -  + lens + ;
                d = lent - d -  + lens + ;
                swap(a, b); swap(c, d);
                len = d - c + ;
                low = , high = rk[c] - , L = rk[c], R = rk[c];
                while(low <= high) {
                    mid = low + high >> ;
                    if(rmq.query(mid + , rk[c]) >= len) high = mid - , L = mid;
                    else low = mid + ;
                }
                low = rk[c] + , high = san;
                while(low <= high) {
                    mid = low + high >> ;
                    if(rmq.query(rk[c] + , mid) >= len) low = mid + , R = mid;
                    else high = mid - ;
                }
                b = b - len + ;
                if(a > b) ans = ;
                else ans = S.bitquery(L, R, a, b);
                printf("%d\n", ans);
            }
        }
    }
    return ;
}

/*
*/