Chef and Cycled Cycles

CodeChefRating 2127Open on judge ↗

Chef recently learned about finding shortest paths in a bidirectional graph. He has following types of graphs with him and would like to find shortest paths between some given pair of vertices. There are N cycles in the graph. Let us enumerate them cycle number 1 to N. The i-th cycle contains Ai nodes enumerated from 1 to Ai. The nodes of a single cycle are connected to each other in cyclic fa

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