New Roads Queries

CSESAdvanced TechniquesOpen on judge ↗

There are n cities in Byteland but no roads between them. However, each day, a new road will be built. There will be a total of m roads. Your task is to process q queries of the form: "after how many days can we travel from city a to city b for the first time?" Input The first input line has three integers n, m and q: the number of cities, roads and queries. The cities are numbered 1,2,\dots,n.

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