|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|1 초||128 MB||5||1||1||100.000%|
Tim the time-traveling salesman owns several time machines that he uses to travel to different points in space-time. These time machines navigate a network of wormholes, with each wormhole connecting two points and taking a certain amount of time to cross. Tim’s time machines are fully automated: they always take the shortest path to their destination.
A recent and violent wormhole storm has caused some of Tim’s time machines to go haywire. These machines loaded up the pre-programmed destinations stored in their memory banks and took off. When each time machine ended its trip it broadcasted a diagnostics signal containing the starting point and length in time of the trip. Tim doesn’t remember the pre-programmed destination for each time machine. However, he does know that no two time machines were programmed for the same destination. Can Tim determine for all of the time machines exactly where (and when) they ended up?
The first line is the number K of input data sets, followed by the K data sets, each of the following form:
The first line contains three integers 1 ≤ M ≤ 20, 2 ≤ N ≤ 100, N − 1 ≤ W ≤ 500, where M is the number of missing time machines, N is the number of space-time locations in the wormhole network, and W is the number of wormholes. Machines are numbered from 1 to M and space-time points are numbered from 1 to N. Next come W lines containing three integers ai bi ci, the space-time locations that wormhole i connects and the number of seconds required to traverse it. No wormhole requires more than 1,000 seconds to cross. Finally there are M lines each containing integers si ti, the starting point and travel time in seconds of time machine i. It is guaranteed that all time machines followed a valid shortest path and reached their destination.
For each data set, output “Data Set x:” on a line by itself, where x is its number. If Tim can determine for all the time machines where they ended their trips, output the ending point for each machine starting from machine 1 and going to machine M on a single line. Two ending points should be separated by a single space. There should be no leading or trailing whitespace on a line. If Tim cannot determine the destination of one or more of the time machines, output “impossible” instead. Each data set should be followed by a blank line.
2 2 4 4 1 2 5 1 4 5 2 3 4 3 4 3 1 5 2 7 1 3 2 1 2 4 1 3 4 1 4
Data Set 1: 2 4 Data Set 2: impossible