Touya Akira vs Shindou Hikaru

CodeChefOpen on judge ↗

After losing to Touya many times in Go, Hikaru wants to defeat Touya in graph game. Graph game is played on an undirected graph as follows - First Hikaru selects a node x. Then touya selects a node y which is adjacent to last selected node i.e. x. Then Hikaru selects a node which is not selected already and is adjacent to y and so on. A player cannot make a move if there is no un-selected node adj

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