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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
#include <algorithm>
using namespace std;
typedef long long LL;
const int N=100000+10;
const int B=17;
int n;
int a[N];
int dcnt;
LL d[N];
namespace Seg{
const int SIZE=N*20;
int rt[N];
int nodeCnt;
int ch[SIZE][2];
LL sum[SIZE];
int (int u){
int v=++nodeCnt;
ch[v][0]=ch[u][0];
ch[v][1]=ch[u][1];
sum[v]=sum[u];
return v;
}
void insert(int u,int &v,int l,int r,int x){
v=copyNode(u);
sum[v]+=d[x];
if(l==r)
return;
int mid=(l+r)>>1;
if(x<=mid)
insert(ch[u][0],ch[v][0],l,mid,x);
else
insert(ch[u][1],ch[v][1],mid+1,r,x);
}
LL query(int u,int l,int r,int x){
if(u==0)
return 0;
if(l==r)
return sum[u];
int mid=(l+r)>>1;
if(x<=mid)
return query(ch[u][0],l,mid,x);
else
return sum[ch[u][0]]+query(ch[u][1],mid+1,r,x);
}
}
namespace Tree{
int h[N];
struct Edge{
int v,next;
}e[N*2];
int etot;
int dep[N];
int pre[N][B+1];
void addEdge(int u,int v){
e[++etot]=(Edge){v,h[u]}; h[u]=etot;
e[++etot]=(Edge){u,h[v]}; h[v]=etot;
}
void buildDFS(int u,int fa){
dep[u]=dep[fa]+1;
pre[u][0]=fa;
for(int i=1;i<=B;i++) pre[u][i]=pre[pre[u][i-1]][i-1];
Seg::insert(Seg::rt[fa],Seg::rt[u],1,dcnt,a[u]);
for(int i=h[u],v;i;i=e[i].next)
if((v=e[i].v)!=fa)
buildDFS(v,u);
}
int getLCA(int a,int b){
if(dep[a]<=dep[b])
swap(a,b);
for(int i=B;i>=0;i--)
if(dep[pre[a][i]]>=dep[b])
a=pre[a][i];
if(a==b)
return a;
for(int i=B;i>=0;i--)
if(pre[a][i]!=pre[b][i]){
a=pre[a][i];
b=pre[b][i];
}
return pre[a][0];
}
LL queryPath(int u,int v,int lca,int x){
return Seg::query(Seg::rt[u],1,dcnt,x)+
Seg::query(Seg::rt[v],1,dcnt,x)-
Seg::query(Seg::rt[lca],1,dcnt,x)*2+
(a[lca]<=x?d[a[lca]]:0);
}
}
void readData(){
scanf("%d",&n);
for(int i=1;i<n;i++){
int u,v;
scanf("%d%d",&u,&v);
Tree::addEdge(u,v);
}
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
}
void Diz(){
for(int i=1;i<=n;i++) d[++dcnt]=a[i];
d[++dcnt]=0;
sort(d+1,d+dcnt+1);
dcnt=unique(d+1,d+dcnt+1)-d-1;
for(int i=1;i<=n;i++) a[i]=lower_bound(d+1,d+dcnt+1,a[i])-d;
}
int DizFind(LL x){
int p=upper_bound(d+1,d+dcnt+1,x)-d;
return p-1;
}
double solve(int a,int b,int k){
int lca=Tree::getLCA(a,b);
LL sum=Tree::queryPath(a,b,lca,dcnt);
LL x=0,s,addition=0;
while(true){
LL origin=Tree::queryPath(a,b,lca,DizFind(x+1));
s=origin+addition;
if(s>x){
x=s;
}else if(k>0){
if(origin==sum)
break;
k--;
addition+=(x+1);
x=s+(x+1);
}else{
break;
}
}
double ans=x+1;
while(k--)
ans*=2;
return ans;
}
void answerQuery(){
int q;
int x,y,k;
scanf("%d",&q);
while(q--){
scanf("%d%d%d",&x,&y,&k);
printf("%.0fn",solve(x,y,k));
}
}
int main(){
readData();
Diz();
Tree::buildDFS(1,0);
answerQuery();
return 0;
}
|
近期评论