1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
| #include <cstdio>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10, M = 2e5 + 10;
int n, p[N], c[N], f[N];
int idx, hd[N], nxt[M], edg[M];
LL s, w[N];
int top, stk[N];
void dfs(int x, int t, LL d)
{
stk[++top] = x;
while (d > s)
d -= w[stk[++t]];
c[x]++, c[p[stk[t]]]--;
for (int i = hd[x]; ~i; i = nxt[i])
dfs(edg[i], t, d + w[edg[i]]);
top--;
}
int cal(int x)
{
int res = c[x];
for (int i = hd[x]; ~i; i = nxt[i])
res += cal(edg[i]);
return f[x] = res;
}
void add(int a, int b)
{
nxt[++idx] = hd[a];
hd[a] = idx;
edg[idx] = b;
}
int main()
{
scanf("%d%lld", &n, &s);
for (int i = 1; i <= n; i++)
hd[i] = -1;
for (int i = 2; i <= n; i++)
{
scanf("%d%lld", &p[i], &w[i]);
add(p[i], i);
}
dfs(1, 1, 0);
cal(1);
for (int i = 1; i <= n; i++)
printf("%d\n", f[i]);
return 0;
}
|