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 1272. Non-Yekaterinburg Subway

Solved(MST)
Posted by Luka Bulatovic 21 Aug 2011 14:00
Solution is Minimum spanning tree (Kruskal or Prim Algorithm). Put low cost on tunnels, and much higher one on bridges with using priority queue ;)
Re: Solved(MST)
Posted by mikroz 20 Dec 2013 14:08
The problem is much easier. You don't need to use Kruskal or Prim to solve it.
Re: Solved(MST)
Posted by adamant 22 Dec 2013 00:47
Well, yes, but we can use this problem to train skills of writing MST algo =)
Re: Solved(MST)
Posted by davidlescano 8 Jul 2017 21:32
DFS!
Re: Solved(MST)
Posted by ____NOOR 30 Oct 2019 13:43
You are trying to kill a fly with a nuclear Bomb :)

Edited by author 30.10.2019 13:44