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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
| #include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10, M = 2e5 + 10;
int n;
int idx, hd[N], nxt[M], edg[M];
int stmp, d[N], p[N], sz[N], son[N], top[N], rnk[N], dfn[N];
struct Node
{
int l, r;
int v;
} tr[N << 2];
void pushup(int x)
{
tr[x].v = tr[x << 1].v + tr[x << 1 | 1].v;
}
int query(int x, int l, int r)
{
if (tr[x].l >= l && tr[x].r <= r)
return tr[x].v;
int res = 0;
int mid = tr[x].l + tr[x].r >> 1;
if (l <= mid)
res += query(x << 1, l, r);
if (r > mid)
res += query(x << 1 | 1, l, r);
return res;
}
void modify(int x, int t)
{
if (tr[x].l == tr[x].r)
{
tr[x].v++;
return;
}
int mid = tr[x].l + tr[x].r >> 1;
if (t <= mid)
modify(x << 1, t);
else
modify(x << 1 | 1, t);
pushup(x);
}
void build(int x, int l, int r)
{
tr[x].l = l;
tr[x].r = r;
if (l == r)
return;
int mid = l + r >> 1;
build(x << 1, l, mid);
build(x << 1 | 1, mid + 1, r);
pushup(x);
}
int QueryPath(int x, int y)
{
int res = 0;
while (top[x] != top[y])
{
if (d[top[x]] < d[top[y]])
swap(x, y);
res += query(1, dfn[top[x]], dfn[x]);
x = p[top[x]];
}
if (d[x] > d[y])
swap(x, y);
return res + query(1, dfn[x], dfn[y]);
}
void dfs1(int x)
{
son[x] = -1;
sz[x] = 1;
for (int i = hd[x]; ~i; i = nxt[i])
if (!d[edg[i]])
{
d[edg[i]] = d[x] + 1;
p[edg[i]] = x;
dfs1(edg[i]);
sz[x] += sz[edg[i]];
if (son[x] == -1 || sz[edg[i]] > sz[son[x]])
son[x] = edg[i];
}
}
void dfs2(int x, int t)
{
top[x] = t;
dfn[x] = ++stmp;
rnk[stmp] = x;
if (son[x] == -1)
return;
dfs2(son[x], t);
for (int i = hd[x]; ~i; i = nxt[i])
if (edg[i] != son[x] && edg[i] != p[x])
dfs2(edg[i], edg[i]);
}
void add(int a, int b)
{
nxt[++idx] = hd[a];
hd[a] = idx;
edg[idx] = b;
}
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
hd[i] = -1;
for (int i = 1, a, b; i < n; i++)
{
scanf("%d%d", &a, &b);
add(a, b);
add(b, a);
}
d[1] = 1;
dfs1(1);
dfs2(1, 1);
build(1, 1, n);
for (int i = 1, a; i <= n; i++)
{
scanf("%d", &a);
printf("%d\n", QueryPath(1, a));
modify(1, dfn[a]);
}
return 0;
}
|