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
stuti_17:
20210105 16:36:22
Just in case you need help hooking up with a homo boyfriend, msg me. Last edit: 20210105 22:19:32 

stuti_17:
20210105 16:35:42
was getting TLE!!!.


up_in_smoke:
20201228 13:08:11
1. Why using set gives TLE ? Because it doesn't keep duplicate entries, use multiset else priority queue.


wille_25:
20201228 09:38:25
AC in one Go :)


shashank5013:
20201225 10:17:30
Was getting TLE


cooldude69:
20201209 23:16:17
<snip>


yaseenmollik:
20201021 10:30:39
AC in one go! Easy problem. Just store these strings into a map and implement standard Dijkstra algorithm. 

abhinav18:
20200817 18:57:00
Naive Dijkstra>TLE, Dijkstra on sparse graphs>AC. ;) 

coolboy7:
20200717 14:04:33
if you are getting tle after every possible optimization, check if you have forgetten to clear your adajency list after each test case. 

sarthak_19:
20200710 10:34:03
Use Priority Queue,Set Costed me 6 TLE Last edit: 20200710 10:34:21 
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) 