HDU-3938 Portal（离线并查集）

最新推荐文章于 2020-07-25 18:50:59 发布

原创

最新推荐文章于 2020-07-25 18:50:59 发布 · 981 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#并查集 #离线

先上原题：

ProblemDescription

ZLGG found a magic theory that the bigger banana the bigger bananapeel .This important theory can help him make a portal in our universal.Unfortunately, making a pair of portals will cost min{T} energies. T in a pathbetween point V and point U is the length of the longest edge in the path.There may be lots of paths between two points. Now ZLGG owned L energies and hewant to know how many kind of path he could make.

Input

There are multiple test cases. The first line of input containsthree integer N, M and Q (1 < N ≤ 10,000, 0 < M ≤ 50,000, 0 < Q ≤ 10,000). N is the number of points, M is the number of edges and Qis the number of queries. Each of the next M lines contains three integers a,b, and c (1 ≤ a, b ≤ N, 0 ≤ c ≤ 10^8) describing an edge connecting the point a and b with cost c.Each of the following Q lines contain a single integer L (0 ≤ L ≤ 10^8).

Output