ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1178. Akbardin’s Roads

Do not bother with shortest ways
Posted by alpha900i 11 Jun 2013 21:49
Spent some time trying to create algorithm, that would make shortest possible set of roads. Then understood, that Akbardin will fight for shortness later; atm he bothered only with having roads without crossing. That why task became so much easier... Hope this would save someone's time.