P4211 [LNOI2014]LCA （树链剖分+思维）

#include<bits/stdc++.h>
using namespace std;
#define debug cout<<"YES\n";
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<pii,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=201314;
const int maxn=1e5+100;
const int lz=0;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);}
vector<int> g[maxn];
///线段树
void Mod(int &x){x%=mod;}
struct segtree{
    int sum[maxn<<2],lazy[maxn<<2];
    void init(){
        mst(sum,0),mst(lazy,0);
    }
    void pushdown(int x,int l,int r){
        int mid=l+r>>1;
        if(lazy[x]){
            lazy[x<<1]+=lazy[x];//Mod(lazy[x<<1]);
            lazy[x<<1|1]+=lazy[x];//Mod(lazy[x<<1|1]);
            sum[x<<1]+=(mid-l+1)*lazy[x]%mod;//Mod(sum[x<<1]);
            sum[x<<1|1]+=(r-mid)*lazy[x]%mod;//Mod(sum[x<<1|1]);
            lazy[x]=0;
        }
    }
    void pushup(int x){
        sum[x]=(sum[x<<1]+sum[x<<1|1])%mod;
    }
    void update(lrt,int L,int R){
        if(L<=l&&r<=R){
            sum[rt]+=(r-l+1),Mod(sum[rt]);
            lazy[rt]++;
            return ;
        }
        pushdown(rt,l,r);
        int mid=l+r>>1;
        if(L<=mid) update(lson,L,R);
        if(mid<R) update(rson,L,R);
        pushup(rt);
    }
    int query(lrt,int L,int R){
        if(L<=l&&r<=R) return sum[rt];
        pushdown(rt,l,r);
        int mid=l+r>>1,ans=0;
        if(L<=mid) ans+=query(lson,L,R),Mod(ans);
        if(mid<R) ans+=query(rson,L,R),Mod(ans);
        return ans;
    }
}seg;
///树剖+线段树维护
int sz[maxn],son[maxn],fa[maxn];
void dfs1(int u,int f){
    sz[u]=1,fa[u]=f;
    for(auto v:g[u]) if(v!=f){
        dfs1(v,u);
        sz[u]+=sz[v];
        if(sz[son[u]]<sz[v]) son[u]=v;
    }
}
int top[maxn],dfn[maxn],tot=0;
void dfs2(int u,int f){
    top[u]=f,dfn[u]=++tot;
    if(son[u]) dfs2(son[u],f);
    for(auto v:g[u]) if(v!=son[u]&&v!=fa[u])
        dfs2(v,v);
}
void modify(int x){
    while(top[x]){
        seg.update(1,tot,1,dfn[top[x]],dfn[x]);
        x=fa[top[x]];
    }
}
int Q(int x){
    int ans=0;
    while(top[x]){
        ans+=seg.query(1,tot,1,dfn[top[x]],dfn[x]);
        Mod(ans);
        x=fa[top[x]];
    }
    return ans;
}

int n,q,ret[maxn];
piii qy[maxn];
vector<piii> tp[maxn];
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>n>>q;
    rep(i,2,n+1){
        int x;cin>>x;x++;
        g[i].push_back(x);
        g[x].push_back(i);
    }
    rep(i,0,q){
        int l,r,x;cin>>l>>r>>x;r++,x++;
        tp[l].push_back(mk(mk(x,-1),i));
        tp[r].push_back(mk(mk(x,1),i));
    }
    dfs1(1,0),dfs2(1,1);
    rep(i,1,n+1){
        modify(i);
        rep(j,0,tp[i].size()){
            int tp1=tp[i][j].fi.fi,tp2=tp[i][j].fi.se;
            ret[tp[i][j].se]+=Q(tp1)*tp2;
            Mod(ret[tp[i][j].se]);
        }
    }
    rep(i,0,q){
        ret[i]=(ret[i]+mod)%mod;
        cout<<ret[i]<<"\n";
    }
    return 0;
}