【BZOJ3720】Gty的妹子树（树分块）

Description

维护一棵初始有n个节点的有根树(根节点为1)，树上节点编号为1-n，每个点有一个权值wi。
支持以下操作：
0 u x 询问以u为根的子树中，严格大于x的值的个数。(u^=lastans,x^=lastans)
1 u x 把u节点的权值改成x。(u^=lastans,x^=lastans)
2 u x 添加一个编号为”当前树中节点数+1”的节点，其父节点为u，其权值为x。(u^=lastans,x^=lastans)
最开始时lastans=0。

---

Solution

考虑对树进行分块，对于每个块存一个vector，和对序列的分块类似，我们对被询问全部包含的块直接进行lower_bound，其他的暴力计算即可。
至于一开始怎么分块，直接dfs，对于每个节点，如果父亲所在的块小于规定的块的大小，那么将该节点加入父亲所在的块，否则新开一个块。

感觉会被菊花图卡？

---

Code

/************************************************
 * Au: Hany01
 * Date: Apr 8th, 2018
 * Prob: [BZOJ3720] Gyt的妹子树
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 60005;

vector<int> bk[maxn];
int n, beg[maxn], nex[maxn << 1], v[maxn << 1], e, beg_[maxn], nex_[maxn << 1], v_[maxn << 1], e_, cnt, sz[maxn], bel[maxn], fa[maxn], w[maxn], W, Ans, block;

inline void add(int uu, int vv) { v[++ e] = vv, nex[e] = beg[uu], beg[uu] = e; }
inline void add_(int uu, int vv) { v_[++ e_] = vv, nex_[e_] = beg_[uu], beg_[uu] = e_; }

void init(int u)
{
    if (sz[bel[fa[u]]] == block) bk[bel[u] = ++ cnt].pb(w[u]), add_(bel[fa[u]], cnt), sz[cnt] = 1;
    else bk[bel[u] = bel[fa[u]]].insert(lower_bound(ALL(bk[bel[fa[u]]]), w[u]), w[u]), ++ sz[bel[u]];
    for (register int i = beg[u]; i; i = nex[i]) if (v[i] != fa[u])
        fa[v[i]] = u, init(v[i]);
}

void dfsblock(int u)
{
    Ans += bk[u].end() - upper_bound(ALL(bk[u]), W);
    for (register int i = beg_[u]; i; i = nex_[i]) dfsblock(v_[i]);
}

void dfs(int u)
{
    if (w[u] > W) ++ Ans;
    for (register int i = beg[u]; i; i = nex[i]) if (v[i] != fa[u])
        if (bel[v[i]] != bel[u]) dfsblock(bel[v[i]]); else dfs(v[i]);
}

int main()
{
#ifdef hany01
    File("bzoj3720");
#endif

    static int uu, vv, lastans = 0;

    n = read();
    For(i, 2, n)
        uu = read(), vv = read(), add(uu, vv), add(vv, uu);
    For(i, 1, n) w[i] = read();

    block = (int)floor(sqrt(n)); //the size of each block should be modified
    sz[0] = block, init(1);

    for (static int m = read(); m --; )
    {
        register int ty = read(), x = read() ^ lastans, y = read() ^ lastans;
        if (!ty) Ans = 0, W = y, dfs(x), printf("%d\n", lastans = Ans);
        else if (ty == 1) {
            register int id = bel[x];
            bk[id].erase(lower_bound(ALL(bk[id]), w[x])), bk[id].insert(lower_bound(ALL(bk[id]), y), w[x] = y);
        } else {
            fa[++ n] = x, w[n] = y, add(x, n);
            if (sz[bel[x]] >= block) bk[bel[n] = ++ cnt].pb(y), add_(bel[x], cnt), sz[cnt] = 1;
            else bk[bel[n] = bel[x]].insert(lower_bound(ALL(bk[bel[x]]), y), y), ++ sz[bel[x]];
        }
    }

    return 0;
}
//漠漠水田飞白鹭，阴阴夏木啭黄鹂。
//    -- 王维《秋归辋川庄作》