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 1742. Team building

HINT
Posted by Dhaval Rathod 26 Feb 2022 23:07
first make a SCC , u will get max
iterate through scc graph root nodes and in dfs the node size is great than 2 increment answer u will get min