计量大学 A A Party for You Started

A A Party for You Started

Welcome to the grand party for $CJLUACMer$, we are glad about your arrival. Before starting, please remind that the difficulty of all the problems is absolutely not relevant to its order of permutation, so please consider the order of accomplishment by yourself. Now let us get started!

$CJLUACMer$ comes from $N$ factions. Some factions with the majority of people, based on broad range fields, such as Mathematics, and others may be more specific, such as Geometry, Algebra. Moreover, it contains complex relationships beyond different types of factions. For example, let faction $1$(Geometry) belongs to faction $2$(Mathematics) if there are two people from faction $1$ and one person from faction $2$ initially. We can say there are two people belongs to faction $1$ or three people belongs to faction $2$. People attending parties like to ask if somebody is present, so when someone from a certain faction comes, he(or she) will ask the security guard $GYQ$ how many people have come from another particular faction, maybe wide range or just minority.

Generally, every moment there will be $x$ people who belong to the faction $u$ arrive at the party, and they will ask how many people had come from the faction $v$. The security guard $GYQ$ had to run in to check the number of people every time, so he was so busy and sweaty.

Now given that $CJLUACMer$ has $N$ factions in total and $M$ groups of people who come to the party once at a time. And given an array $a$, the index aia_ia​i​​ represents the parent faction of the $i$-th faction, it's guaranteed that each specific faction belongs to only one superior faction(which means just a level higher), and there is exactly one $0$ in the array, which indicates the whole $CJLUACM$ association and this faction is the largest. After that, there will be $M$ queries within the format of u x v, whose meaning is as described above. Could you help the security guard $GYQ$ answer every query?

Input Specification:

Each input file only contains one test case.

The first line contains two integers $N$ and $M$ ($1$ ≤ $N$ ≤ $2$ × 10410^410​4​​, $1$ ≤ $M$ ≤ 10510^510​5​​), indicating the number of the factions and the queries.

The second line contains $N$ integers a1a_1a​1​​, a2a_2a​2​​,……, ana_na​n​​ ($1$ ≤ aia_ia​i​​ ≤ $N$), indicating the parent faction of the $i$-th faction, and there is exactly one $0$ in the array.

Then followed $M$ lines, each line contains three integers $u$, $x$, $v$ ($1$ ≤ $u$, $v$ ≤ $N$, $1$ ≤ $x$ ≤ 10910^910​9​​), indicating there are $x$ people who belong to the faction $u$ arrive at the party, and they asked how many people had come from the faction $v$.

Output Specification:

Print $M$ lines, each line contains an integer indicating the answer of the security guard $GYQ$ in order.

Sample Input:

4 5
0 1 1 2
1 2 2
2 1 2
4 1 2
3 1 3
3 1 4

  
  

   
   

    
    
   
   
  
  

Sample Output:

0
2
3
2
4

  
  

   
   

    
    
   
   
  
  

题意

聚会开始啦。
有很多人要进场，然后每个人会一个技能，技能们之间是一棵树。
举一个简单的例子，会数学的同学就会几何和代数，所以有一个人会数学就会有一个人会代数，但是会代数的人不一定会几何hhh
给定一颗技能树，每次先询问会场中会某项技能的人的数量，然后给某个节点加上$X$个人（需要对子技能的所有节点也加上人数）。

简析

树链部分，队友写的hhhh

参考代码

#include <bits/stdc++.h>
using namespace std;
const int N = 20005;
typedef long long ll;
struct Edge {
	int to, next;
}edge[N * 2];

int head[N], tot;
int top[N], fa[N], deep[N], num[N], p[N], fp[N], son[N], pos;

void init() {
	tot = 0;
	memset(head, -1, sizeof head);
	pos = 1;
	memset(son, -1, sizeof son);
}

void addedge(int u, int v) {
	edge[tot].to = v, edge[tot].next = head[u], head[u] = tot++;
}

void dfs1(int u, int pre, int d) {
	deep[u] = d;
	fa[u] = pre;
	num[u] = 1;
	for (int i = head[u]; ~i; i = edge[i].next) {
		int v = edge[i].to;
		if (v != pre) {
			dfs1(v, u, d + 1);
			num[u] += num[v];
			if (son[u] == -1 || num[v] > num[son[u]]) {
				son[u] = v;
			}
		}
	}
}

void getpos(int u, int sp) {
	top[u] = sp;
	p[u] = pos++;
	fp[p[u]] = u;
	if (son[u] == -1) return;
	getpos(son[u], sp);
	for (int i = head[u]; ~i; i = edge[i].next) {
		int v = edge[i].to;
		if (v != son[u] && v != fa[u])
			getpos(v, v);
	}
}

int lowbit(int x) {
	return x & (-x);
}

ll c[N];
int n;
ll sum(int i) {
	ll s = 0;
	while (i > 0) {
		s += c[i];
		i -= lowbit(i);
	}
	return s;
}

void add(int i, int val) {
	while (i <= n) {
		c[i] += val;
		i += lowbit(i);
	}
}

void Change(int u, int v, int val) {
	int f1 = top[u], f2 = top[v];
	int tmp = 0;
	while (f1 != f2) {
		if (deep[f1] < deep[f2]) {
			swap(f1, f2);
			swap(u, v);
		}
		add(p[f1], val);
		add(p[u] + 1, -val);
		u = fa[f1];
		f1 = top[u];
	}
	if (deep[u] > deep[v]) swap(u, v);
	add(p[u], val);
	add(p[v] + 1, -val);
}
int a[N];

void modify(int u, int val)
{
	int f1 = p[u], f2 = p[u] + num[u] - 1;
	add(f2 + 1, -val), add(f1, val);
}

int main() {
	// freopen("in.txt", "r", stdin);
	int m;
	scanf("%d%d", &n, &m);
	init();
	int pa, root;
	for (int i = 1; i <= n; ++i)
	{
		scanf("%d", &pa);
		if (pa == 0)
		{
			root = i;
		}
		else
		{
			addedge(pa, i);
			addedge(i, pa);
		}
	}

	dfs1(root, 0, 0);
	getpos(root, root);
	
	memset(c, 0, sizeof c);

	int u, x, v;
	while (m--)
	{
		scanf("%d%d%d", &u, &x, &v);

		printf("%lld\n", sum(p[v]));

		modify(u, x);
	}
	return 0;
}