Building Teams

CSESGraph AlgorithmsOpen on judge ↗

There are n pupils in Uolevi's class, and m friendships between them. Your task is to divide the pupils into two teams in such a way that no two pupils in a team are friends. You can freely choose the sizes of the teams. Input The first input line has two integers n and m: the number of pupils and friendships. The pupils are numbered 1,2,\dots,n. Then, there are m lines describing the friendshi

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI