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 belonging 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
kuderrahul:
20230826 16:18:49
Note to self


devilsblast:
20230329 20:59:52
using simple priority queue with multiple query will help and directed with be accepted and undirected also ok there are no critical test cases if you are using simple set or simple queue or simple algorithm(nor set neither queue) then it will give tle 

yag:
20230111 11:14:00
Polska gurom !!!!!


wttc:
20221227 07:27:25
Note:


kazi_rasel13:
20221216 10:54:55
anyone give me a testcase..


eroy_cotonou:
20211221 18:53:47
Is python code possible for this problem ?


loser_404:
20210813 08:32:56
Is the graph directed or undirected? why both of the solution get accepted? 

vivekbillore:
20210801 21:51:28
just use priority queue to avoid TLE , it is faster than using set in dijkstra 

Waseem Ahmed:
20210626 12:44:01
Finally got it accepted.


rushi2001:
20210513 21:21:16
Simple Dijstra with following note .

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) 