哈理工oj Touring (最短路 dij算法 邻接表 + 队列 )

For each test case, first print a line saying "Scenario #p", where p is the number of the test case.Then,if both Mr. Li and Mr. Liu can manage to arrive their cities,output the minimum cost they will spend,otherwise output "Can not reah!", in one line.Print a blank line after each test case, even after the last one.

,游手好闲会使人心智生锈

哈理工oj Touring (最短路 dij算法 邻接表 + 队列 )

相关文章:

你感兴趣的文章:

标签云: