bzoj 3683: Falsita

传送门：http://www.lydsy.com/JudgeOnline/problem.php?id=3683
思路：
这题并不难。。。化简题目中的条件，每一个点的答案是每个儿子的贡献和，那么要支持点修改的话，考虑对于到根这一段点的影响，是不能直接打标记的，但可以上链剖，这样有一个好处就是点到根至多有$log{n}$条轻链，于是我们可以轻链暴力修改，重链直接打上关于重儿子的标记即可，子树修改也是一样，链剖真的很神奇啊。。。不过也不知道是姿势不对还是别的啥，写了7k+，另外值得一提的是如果是在图上而每个点的答案和其相邻点相关的话可以按度数分块，和链剖是差不多的。。。
值得吐槽的是我做这题是为了写手工栈。。。SD无聊的很天天就希望我们爆他们的栈。。。
复杂度：$O(nlog^2{n})$

代码：

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#define N 300002
using namespace std;
typedef long long LL;
struct edge
{
    int nxt,point,v;
};

edge e[N << 1];
LL n,m,cnt,sz[N],mx[N],top[N],S[N],fa[N],W[N];
//mx记录的最大子树的边的编号 
        inline void in1(int &x)
        {
            char c;int sy = 1;
            while (!isdigit(c = getchar()))
                if (c == '-') sy = -1;
            x = (c ^ 48);
            while (isdigit(c = getchar())) x = 10 * x + (c ^ 48);
            x *= sy;
        }

        inline void in2(LL &x)
        {
            char c;int sy = 1;
            while (!isdigit(c = getchar()))
                if (c == '-') sy = -1;
            x = (c ^ 48);
            while (isdigit(c = getchar())) x = 10 * x + (c ^ 48);
            x *= sy;
        }
        inline void add(int u1,int v1)
        {
            e[++cnt].nxt = e[u1].point; e[u1].point = cnt; e[cnt].v = v1;
        }
    inline void insert(int u1,int v1)
    {
        add(u1,v1);
        add(v1,u1);
    }
inline void init()
{
    in2(n); in2(m);
    for (int i = 2;i <= n; ++i)
        in2(fa[i]);
    for (int i = 1;i <= n; ++i)
        in2(W[i]);
    cnt = 0;
    for (int i = 2;i <= n; ++i)
        insert(i,fa[i]);
}

int cur[N],L[N],R[N],st[N],t;

        inline void GET(int x,int &p)
        {
            while (p&&(e[p].v == fa[x]||p == mx[x]))
                p = e[p].nxt;
        }

    //链剖的两个dfs，第一个求sz和最大的子树sz 
    inline void dfs1()
    {
        memset(mx,0,sizeof(mx));
        for (int i = 1;i <= n; ++i)
        {
            sz[i] = 1;
            S[i] = W[i];
            cur[i] = e[i].point;
            GET(i,cur[i]);
        }
        int r;
        st[r = 1] = 1;
        while (r)
        {
            int x = st[r];
            if (cur[x])
            {
                st[++r] = e[cur[x]].v;
            }
            else
            {
                sz[fa[x]] += sz[x];
                S[fa[x]] += S[x];
                if (!mx[fa[x]] || sz[x] > sz[e[mx[fa[x]]].v]) mx[fa[x]] = cur[fa[x]];
                cur[fa[x]] = e[cur[fa[x]]].nxt;
                GET(fa[x],cur[fa[x]]);
                --r;
            }
        }
    }
    //求dfs序和top,顺便统计一些信息 
    inline void dfs2()
    {
        for (int i = 1;i <= n; ++i)
        {
            cur[i] = mx[i];
        }
        int r;
        st[r = 1] = 1; top[1] = 1; t = 1;
        L[1] = 1;
        while (r)
        {
            int x = st[r];
            if (cur[x])
            {
                st[++r] = e[cur[x]].v;
                L[st[r]] = ++t;
                if (cur[x] != mx[x]) 
                    top[st[r]] = st[r];
                else top[st[r]] = top[x];
                if (cur[x] == mx[x])
                    cur[x] = e[x].point;
                    else cur[x] = e[cur[x]].nxt;
                GET(x,cur[x]);
            }
            else
            {
                R[x] = t;
                --r;
            }
        }
    }

LL tag1[N << 2],tag2[N << 2],g[N],f[N];
//g[i]表示i的子树大小的平方和 
//f[i]表示维护的答案
//w[i]表示每个点的值
//S[i]表示子树和

    inline void build(int l,int r,int rt)
    {
        int mid = (r + l) >> 1;
        tag1[rt] = tag2[rt] = 0;
        if (l == r) return;
        build(l,mid,rt << 1);
        build(mid + 1,r,rt << 1|1);
    }

int u;
LL delta;
inline void Pre()
{
    dfs1();
    dfs2(); 
    for (int i = 1;i <= n; ++i)
    {
        g[i] = f[i] = 0;
        for (int p = e[i].point;p;p = e[p].nxt)
            if (e[p].v != fa[i])
            {
                g[i] += 1LL * sz[e[p].v] * sz[e[p].v];
                f[i] += 1LL * sz[e[p].v] * S[e[p].v];
            }
    }
    build(1,n,1);
}
            inline void pushdown(int rt)
            {
                tag1[rt << 1] += tag1[rt];
                tag1[rt << 1|1] += tag1[rt];
                tag2[rt << 1] += tag2[rt];
                tag2[rt << 1|1] += tag2[rt];
                tag1[rt] = tag2[rt] = 0;
            }

        inline void change1(int l,int r,int rt,int ll,int rr,LL d)
        {
            if (ll > rr) return;
            if (l < r) pushdown(rt);
            int mid = (r + l) >> 1;
            if (ll <= l&&rr >= r)
            {
                tag1[rt] += d;
                return;
            }
            if (ll <= mid) change1(l,mid,rt << 1,ll,rr,d);
            if (rr > mid) change1(mid + 1,r,rt << 1|1,ll,rr,d);
        }

    inline void Single(int x,LL d)
    {
        for (int now = x,last;now;last = top[now],now = fa[last])
        {
            if (now != x)
            {
                S[now] += d;
                f[now] += d * sz[last];
            }
            change1(1,n,1,L[top[now]],L[now] - 1,d);
        }
    }

        inline void change2(int l,int r,int rt,int ll,int rr,LL d)
        {
            if (ll > rr) return;
            if (l < r) pushdown(rt);
            int mid = (r + l) >> 1;
            if (ll <= l&&rr >= r) 
            {
                tag2[rt] += d;
                return;
            }
            if (ll <= mid) change2(l,mid,rt << 1,ll,rr,d);
            if (rr > mid) change2(mid + 1,r,rt << 1|1,ll,rr,d);
        }

    inline void Sub()
    {
        in1(u); in2(delta);
        Single(u,delta * sz[u]);
        //printf("%d %d %d\n",u,L[u],R[u]);
        change2(1,n,1,L[u],R[u],delta);
    }

double A,B;
        inline int query(int l,int r,int rt,int pos)
        {
            if (l < r) pushdown(rt);
            int mid = (r + l) >> 1;
            if (l == r) return rt;
            if (pos <= mid) return query(l,mid,rt << 1,pos);
            else return query(mid + 1,r,rt << 1|1,pos);
        }

    inline void Query()
    {
        in1(u);
        int x = query(1,n,1,L[u]);
        A = B = 0;
        B = ((sz[u] - 1) * (sz[u] - 1) - g[u]) / 2 + (sz[u] - 1);//1LL * sz[u] * (sz[u] - 1) - g[u];
        A = (S[u] + sz[u] * tag2[x] + tag1[x]) * sz[u]
        - (W[u] + tag2[x])
        - f[u] - tag2[x] * g[u] - tag1[x] * sz[e[mx[u]].v];
        printf("%.6lf\n",A / B);
    }
inline void DO_IT()
{
    Pre();
    char ch[10];
    for (int i = 1;i <= m; ++i)
    {
        scanf("%s",ch);
        if (ch[0] == 'S') 
        {   
            //scanf("%d %lld",&u,&delta);
            in1(u); in2(delta);
            W[u] += delta; S[u] += delta;
            Single(u,delta);
        }
        if (ch[0] == 'M') Sub();
        if (ch[0] == 'Q')
            Query();
    }
}

 main()
{
    //freopen("input.txt","r",stdin);
//    freopen("bzoj3683.out","w",stdout);
    init();
    DO_IT();
    fclose(stdin); fclose(stdout);
    return 0;
}