BFS before DFS

CodeChefRating 3197Open on judge ↗

Alice and Bob live in a country in which there are $N$ cities (numbered from $1$ to $N$) connected to each other using $N-1$ bidirectional roads in such a way that any two cities are reachable from each other. This country has a special property: for each city in the country, there are **at most** $6$ roads directly connected to it. Alice and Bob both decide to go on a tour of the country, start

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