时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
64bit IO Format: %lld
题目描述
You are given a graph with 
vertices and 
undirected edges of length 
. You can do the following operation on the graph for arbitrary times:
is no more than 
.
Choose an edgeYou need to find out the maximum number of vertices whose minimum distance to vertexand replace it by two edges,
and
, where
is a newly inserted vertex. Both of the two edges are of length
输入描述:
The first line contains three integers,
and
.
Each of the nextlines contains two integers
and
, indicating an edge between
. It is guaranteed that there are no self-loops or multiple edges.
输出描述:
Output an integer indicating the maximum number of vertices whose minimum distance to vertexis no more than
.
备注:
Here is the illustration for the second example.
