树链剖分+线段树+离线
挂题解:http://blog.csdn.net/popoqqq/article/details/38823457
主要思想:对于询问[l,r]和z,可以把[l,r]的每一个点到根的路径上的边的权值分别+1,计算z到根的路径权值和就是所求询问。发现询问[l,r]可以拆成[1,r]的询问减去[1,l-1]的询问,于是离线排序做即可。
好巧妙- -,我等蒟蒻完全想不到
#include<cstdio>
#include<algorithm>
#define N 50005
#define MOD 201314
#define ll long long
using namespace std;
struct edge{int next,to;}e[N<<1];
struct ques{int m, x, id, ans;}q[N<<1];
int ecnt=0, last[N], siz[N], top[N], son[N], dep[N], fa[N], pos[N], tcnt, l[10*N], r[10*N], v[10*N], lazy[10*N];
bool cmp(ques a, ques b){return a.m<b.m;}
bool cmp_id(ques a, ques b){return a.id<b.id;}
void add(int a, int b)
{
e[++ecnt]=(edge){last[a],b};
last[a]=ecnt;
}
void dfs1(int x)
{
dep[x]=dep[fa[x]]+1;
siz[x]=1;
for(int i = last[x]; i; i=e[i].next)
{
int y=e[i].to;
fa[y]=x;
dfs1(y);
siz[x]+=siz[y];
if(siz[y]>siz[son[x]])
son[x]=y;
}
}
void dfs2(int x)
{
pos[x]=++tcnt;
if(son[fa[x]]==x)top[x]=top[fa[x]];
else top[x]=x;
if(son[x])
{
dfs2(son[x]);
for(int i = last[x]; i; i=e[i].next)
{
int y=e[i].to;
if(y==son[x])continue;
dfs2(y);
}
}
}
void pushdown(int x)
{
if(!lazy[x])return;
v[x<<1]=(v[x<<1]+lazy[x]*(r[x<<1]-l[x<<1]+1))%MOD;
v[x<<1|1]=(v[x<<1|1]+lazy[x]*(r[x<<1|1]-l[x<<1|1]+1))%MOD;
lazy[x<<1]+=lazy[x];
lazy[x<<1|1]+=lazy[x];
lazy[x]=0;
}
void build(int x, int left, int right)
{
l[x]=left;
r[x]=right;
v[x]=0;
if(left==right)return;
int mid=(left+right)>>1;
build(x<<1,left,mid);
build(x<<1|1,mid+1,right);
}
void change(int x, int left, int right, int val)
{
pushdown(x);
if(left<=l[x] && r[x]<=right)
{
lazy[x]+=val;
v[x]=(v[x]+(r[x]-l[x]+1)*val)%MOD;
return;
}
int mid=(l[x]+r[x])>>1;
if(left<=mid)change(x<<1,left,right,val);
if(mid+1<=right)change(x<<1|1,left,right,val);
v[x]=v[x<<1]+v[x<<1|1];
}
int query(int x, int left, int right)
{
pushdown(x);
if(left<=l[x] && r[x]<=right)
return v[x];
int mid=(l[x]+r[x])>>1, ret=0;
if(left<=mid)ret=(ret+query(x<<1,left,right))%MOD;
if(mid+1<=right)ret=(ret+query(x<<1|1,left,right))%MOD;
return ret;
}
void update(int x)
{
while(x)
{
change(1,pos[top[x]],pos[x],1);
x=fa[top[x]];
}
}
int query_root(int x)
{
int ret=0;
while(x)
{
ret=(ret+query(1,pos[top[x]],pos[x]))%MOD;
x=fa[top[x]];
}
return ret;
}
int main()
{
int n, Q;
scanf("%d%d",&n,&Q);
for(int i = 2; i <= n; i++)
{
int fat;
scanf("%d",&fat);
add(fat+1,i);
}
dfs1(1);
dfs2(1);
build(1,1,n);
for(int i = 1; i <= Q; i++)
{
int left, right, z;
scanf("%d%d%d",&left,&right,&z);
q[(i<<1)-1]=(ques){left,z+1,(i<<1)-1,0};
q[i<<1]=(ques){right+1,z+1,i<<1,0};
}
sort(q+1,q+1+2*Q,cmp);
int cur = 1;
while(q[cur].m==0)cur++;
for(int i = 1; i <= n; i++)
{
update(i);
for(;q[cur].m==i; cur++)
{
q[cur].ans=query_root(q[cur].x);
}
}
sort(q+1,q+1+2*Q,cmp_id);
for(int i = 1; i <= Q; i++)
printf("%d\n",((q[i<<1].ans-q[(i<<1)-1].ans)%MOD+MOD)%MOD);
}