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

Solution is pretty easy
Posted by 2ch 7 Feb 2018 21:51
Firstly, the problem asks to find number of edges in minimum edge cover
Secondly, the number of such edges plus the number of maximum matching equals to number of vertices, that is N + M
Thirdly, you can find the number of max. matching easily with dfs-like algorithm (you can find code online).

The answer is N + M - (number of max. matching)