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 1109. Conference

AC)))
Posted by pmartynov 19 Jun 2013 18:36
To solve this problem you need to find maximum cardinality SET of edges with the property that no two edges share an endpoint. It can be done using Hopcroft-Karp algorithm. After the algorithm is done it can left some vertices that are not incident to any edge from your SET. Add one edge for each of them.

Also is there anyone who solved it using Ford-Fulkerson algorithm? I personally have TL, solving it that way.
Re: AC)))
Posted by Sergey Ubogov 15 Apr 2017 14:12
I decided using the algorithm of kuhn