SHPATH  The Shortest Path
You are given a list of cities. Each direct connection between two cities has its transportation cost (an integer bigger than 0). The goal is to find the paths of minimum cost between pairs of cities. Assume that the cost of each path (which is the sum of costs of all direct connections belongning to this path) is at most 200000. The name of a city is a string containing characters a,...,z and is at most 10 characters long.
Input
s [the number of tests <= 10] n [the number of cities <= 10000] NAME [city name] p [the number of neighbours of city NAME] nr cost [nr  index of a city connected to NAME (the index of the first city is 1)] [cost  the transportation cost] r [the number of paths to find <= 100] NAME1 NAME2 [NAME1  source, NAME2  destination] [empty line separating the tests]
Output
cost [the minimum transportation cost from city NAME1 to city NAME2 (one per line)]
Example
Input: 1 4 gdansk 2 2 1 3 3 bydgoszcz 3 1 1 3 1 4 4 torun 3 1 3 2 1 4 1 warszawa 2 2 4 3 1 2 gdansk warszawa bydgoszcz warszawa Output: 3 2
Warning: large Input/Output data, be careful with certain languages
hide comments
epsilonalpha:
20170418 15:33:18
A/C after 5 TLE.


anurag_tangri:
20170418 11:06:01
fast i/o _/\_ 

ANKIT JAIN:
20170417 20:52:31
AC in one go :) Happy !!!


ajeetk_973:
20170401 20:19:04
AC in one go using priority queue 

amandal799:
20170329 10:40:28
AC in one go without using Fast I/O but it took 0.37 sec 

scorpion_ajay:
20170313 18:51:34
if you are getting tle :


nilabja16180:
20170311 10:14:29
FAST I/O, map and dijkstra's algo,


rishi_07:
20170309 22:03:19
priority queue _/\_ 

hacker_sk:
20170211 23:01:15
mine 0.32 sec in cpp hahaha :D 

tushar091:
20161113 11:57:54
getting NZEC in SPOJ while running fine in ideone

Added by:  Darek Dereniowski 
Date:  20040510 
Time limit:  1.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  DASM Programming League 2003 (problemset 11) 