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
maciekk1:
20160211 18:25:24
Just remember about empty line after each test case Last edit: 20160211 18:33:55 

Prateek Agarwal:
20160130 12:07:14
Finally AC after a lot of WA's!! No C++ STL used(except for city and index mapping). Used min heap operations. 

epsilon:
20160124 15:00:38
wow stl c++ :)


satyam bajpai:
20160122 05:38:38
is it a directed graph ? 

Divyansh Shukla:
20151219 21:07:29
1.39s :) using Java. Hints: use adjacency list for storage and inbuilt priority queue for Dijkstra. 

romilpunetha:
20151119 15:19:11
Used unordered_map<string,int>. compile error for g++4.3.2 and g++ 5.1. Accepted for C14 g++5.1. Any idea? 

vijay77794:
20151113 12:24:52
replaced cin by scanf and got ac........ :)


ARUN P:
20150928 20:07:31
Are the cities given in order according to their indices? 

Rohit Agarwal:
20150904 22:11:33
Wow. Really nice question. It teaches the importance of optimization.


sri varun:
20150726 16:36:35
Last edit: 20150726 16:38:25 
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) 