2 人解决，7 人已尝试。
5 份提交通过，共有 44 份提交。
9.5 EMB 奖励。
1779. Cycling
单点时限: 30.0 sec
内存限制: 256 MB
You want to cycle to a programming contest. The shortest route to the contest might
be over the tops of some mountains and through some valleys. From past experience you
know that you perform badly in programming contests after experiencing large differences
in altitude. Therefore you decide to take the route that minimizes the altitude difference,
where the altitude difference of a route is the difference between the maximum and the
minimum height on the route. Your job is to write a program that finds this route.
You are given:
-
the number of crossings and their altitudes, and
-
the roads by which these crossings are connected.
Your program must find the route that minimizes the altitude difference between the
highest and the lowest point on the route. If there are multiple possibilities, choose the
shortest one.
For example:
In this case the shortest path from 1 to 7 would be through 2, 3 and 4, but the altitude
difference of that path is 8. So, you prefer to go through 5, 6 and 4 for an altitude difference
of 2. (Note that going from 6 directly to 7 directly would have the same difference in
altitude, but the path would be longer!)
输入格式
On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test
case:
- One line with two integers n (1 <= n <= 100) and m (0 <= m <= 5 000): the number of
crossings and the number of roads. The crossings are numbered 1..n.
-
n lines with one integer hi (0 <= hi <= 1 000 000 000): the altitude of the i-th crossing.
-
m lines with three integers aj , bj (1 <= aj , bj <= n) and cj (1 <= cj <= 1 000 000): this
indicates that there is a two-way road between crossings aj and bj of length cj . You
may assume that the altitude on a road between two crossings changes linearly.
You start at crossing 1 and the contest is at crossing n. It is guaranteed that it is possible
to reach the programming contest from your home.
输出格式
For each testcase, output one line with two integers separated by a single space:
-
the minimum altitude difference, and
-
the length of shortest path with this altitude difference.
样例
Input
1 7 9 4 9 1 3 3 5 4 1 2 1 2 3 1 3 4 1 4 7 1 1 5 4 5 6 4 6 7 4 5 3 2 6 4 2
Output
2 11
题目标签