DCP-466: Sanvi and TreeMap Back to All Problems
Easy
Beginners Problems > Ad-hoc
**Sanvi** is a very cute girl. She wants to travel different cities around the world. Recently, She has got a map with a list of cities where she is interested to visit including her current city. Different cities are numbered from **1** to **5**, which are: 1. Dhaka 2. Chittagong 3. Rajshahi 4. Kathmandu 5. Butwal And, Map looks like below: ![enter image description here][1] The above map's structure looks like [Tree data structure][2] in computer science. The node representing each city and edge representing connection between two cities and distance between them.<br> Currently Sanvi is staying in one of the above city and she wants to travel to any one of above city( destination city). Your task is to find the total distance she needs to travel to reach the destination city. Input: ------ Input starts with an integer **Q (1<=Q<=20)**, denoting the number of Quires.<br> Each query contains two city names separated by a space between them. City name will be exactly one of the above mentioned city. Output: ------- For each query output the total distance she needs to travel in a single line. Sample Input ------------ 2 Dhaka Butwal Kathmandu Dhaka Sample Output ------------- 8200 3200 [1]: https://s3-ap-southeast-1.amazonaws.com/devskillimagestorage/questionimages/7a6e9cdf-6a59-cb00-1c52-08d54e9de865_a9974d6bf167466ebbea7c7f8321024f_W416xH307.png [2]: https://en.wikipedia.org/wiki/Tree_%28data_structure%29
