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 1160. Network

INCREDIBLE easy problem.
Posted by Mahilewets 17 Jul 2017 18:43
You can just sort edges in non-increasing order and add them sequentially until there are two or more connectivity components...
Re: INCREDIBLE easy problem.
Posted by Mahilewets 17 Jul 2017 18:45
It is absolutely of no importance
How many edges are used
Only the size if the largest edge matters
I DON'T KNOW why the problem rating is not 80, but 300.
Re: INCREDIBLE easy problem.
Posted by Mahilewets 17 Jul 2017 21:22
Don't say things like
There you need DSU
Anansi's Cobweb requires DSU
And it is only 170 rating points