
ZOJ Problem Set  1456
These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The transportation fee consists of two parts: The cost of the transportation on the path between these cities, and
The data of path cost, city tax, source and destination cities are given in the input, which is of the form: a11 a12 ... a1N c d where aij is the transport cost from city i to city j, aij = 1 indicates there is no direct path between city i and city j. bi represents the tax of passing through city i. And the cargo is to be delivered from city c to city d, city e to city f, ..., and g = h = 1. You must output the sequence of cities passed by and the total cost which is of the form:
From e to f : Note: if there are more minimal paths, output the lexically smallest one. Print a blank line after each test case.
From 3 to 5 : From 2 to 4 : Source: Asia 1996, Shanghai (Mainland China) 