You are not logged in. Please login at www.codechef.com to post your questions!

×

# Sheldon and the mission

 0 qstn:---- http://www.codechef.com/DCL1501/problems/DCL2015D can anyone provide me the Editorial for this question Thank you asked 09 Mar '15, 21:20 3★nil96 180●7●18●45 accept rate: 5%

 1 Here is my solution. Basically for all N vertices, construct a graph with N^2 edges where vertex i represents point (x[i],y[i]). Weight of the edge between vertex i and j will be distance between the two points. Source vertex will be (0,0) and destination vertex will be given. Run dijkstra's algorithm from the source vertex and determine the minimum distance between the source and the destination. answered 09 Mar '15, 22:26 333●2●3●9 accept rate: 20%
 1 Here's the editorial : http://discuss.codechef.com/questions/65784/dcl2015d-editorial answered 10 Mar '15, 02:38 1.8k●4●9●32 accept rate: 14%
 toggle preview community wiki:
Preview

### Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• link:[text](http://url.com/ "title")
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×110

question asked: 09 Mar '15, 21:20

question was seen: 493 times

last updated: 10 Mar '15, 02:38