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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
long long read()
{
long long x=0,f=1; char c=getchar();
while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
while(isdigit(c)){x=x*10+c-'0';c=getchar();}
return x*f;
}
const int N=100000+100;
const int M=50*N;
struct SPLAY
{
#define root son[r][1]
int son[M][2],size[M],cnt[M],fa[M],w[M],to,toUse[M],top;
inline void update(int x)
{
size[x]=size[son[x][0]]+size[son[x][1]]+cnt[x];
}
inline void rotate(int x,int type)
{
int y=fa[x],z=fa[y];
fa[x]=z,son[z][y==son[z][1]]=x;
fa[son[x][type]]=y,son[y][!type]=son[x][type];
fa[y]=x,son[x][type]=y;
update(y),update(x);
}
void splay(int x,int to)
{
while(fa[x]!=to)
{
if(fa[fa[x]]!=to and x==son[fa[x]][fa[x]==son[fa[fa[x]]][1]])
rotate(fa[x],x==son[fa[x]][0]),
rotate(x,x==son[fa[x]][0]);
else
rotate(x,x==son[fa[x]][0]);
}
}
int newNode()
{
if(top!=0)
{
son[toUse[top]][0]=son[toUse[top]][1]=0;
size[toUse[top]]=fa[toUse[top]]=cnt[toUse[top]]=w[toUse[top]]=0;
return toUse[top--];
}
return ++to;
}
void Insert(int num,int r)
{
if(root==0)
{
root=newNode(),fa[root]=r;
w[root]=num,cnt[root]=1;
update(root);
return;
}
int now=root,last=r;
while(now!=0)
{
if(w[now]==num)
{
cnt[now]++,update(now);
splay(now,r);
return;
}
last=now,now=son[now][num>w[now]];
}
now=newNode();
fa[now]=last,son[last][num>w[last]]=now;
w[now]=num,cnt[now]=1,update(now);
splay(now,r);
}
int Query(int now,int r,int K)
{
if(size[son[now][1]]>=K)
return Query(son[now][1],r,K);
K-=(cnt[now]+size[son[now][1]]);
if(K<=0)
{
splay(now,r);
return w[now];
}
return Query(son[now][0],r,K);
}
void dfs(int now,int r)
{
if(now==0) return;
for(int i=1;i<=cnt[now];i++)
Insert(w[now],r);
dfs(son[now][0],r);
dfs(son[now][1],r);
toUse[++top]=now;
}
#undef root
}splay;
int fa[N],size[N],root[N];
int FindFather(int x)
{
if(fa[x]==0) return x;
return fa[x]=FindFather(fa[x]);
}
void Merge(int x,int y)
{
if(FindFather(x)==FindFather(y)) return;
if(size[FindFather(x)]>size[FindFather(y)]) swap(x,y);
splay.dfs(splay.son[root[FindFather(x)]][1],root[FindFather(y)]);
size[FindFather(y)]+=size[FindFather(x)];
fa[FindFather(x)]=FindFather(y);
}
struct edge
{
int s,t,w;
friend bool operator < (edge x,edge y)
{
return x.w<y.w;
}
}e[M];
struct Query
{
int x,K,w,ans,no;
friend bool operator < (Query a,Query b)
{
return a.w<b.w;
}
}query[M];
bool cmp(Query a,Query b)
{
return a.no<b.no;
}
int Ask(int x,int K)
{
if(size[FindFather(x)]<K) return -1;
return splay.Query(splay.son[root[FindFather(x)]][1],root[FindFather(x)],K);
}
int n,m,q,h[N];
int main()
{
int t=clock();
freopen("4197.in","r",stdin);
freopen("4197.out","w",stdout);
n=read(),m=read(),q=read();
for(int i=1;i<=n;i++)
h[i]=read();
for(int i=1;i<=n;i++)
root[i]=splay.newNode(),size[i]=1;
for(int i=1;i<=n;i++)
splay.Insert(h[i],root[i]);
for(int i=1;i<=m;i++)
e[i].s=read(),e[i].t=read(),e[i].w=read();
for(int i=1;i<=q;i++)
query[i].x=read(),query[i].w=read(),query[i].K=read(),query[i].no=i;
sort(e+1,e+1+m);
sort(query+1,query+1+q);
int w_to=1;
for(int i=1;i<=q;i++)
{
for(;e[w_to].w<=query[i].w and w_to<=m;w_to++)
Merge(e[w_to].s,e[w_to].t);
query[i].ans=Ask(query[i].x,query[i].K);
}
sort(query+1,query+1+q,cmp);
for(int i=1;i<=q;i++)
printf("%d\n",query[i].ans);
cerr<<clock()-t<<endl;
return 0;
}
|
