Editorial for ICPC NEERC 2010 K - Graph Oddity
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
- On an odd
-graph, at least one node has degree strictly less than
- Run DFS starting from this node
- When backing out from DFS, color each node
- Each node in DFS tree will have strictly less than
- Each node in DFS tree will have strictly less than
Comments