Reachability Queries

CSESAdvanced TechniquesOpen on judge ↗

A directed graph consists of n nodes and m edges. The edges are numbered 1,2,\dots,n. Your task is to answer q queries of the form "can you reach node b from node a?" Input The first input line has three integers n, m and q: the number of nodes, edges and queries. Then there are m lines describing the edges. Each line has two distinct integers a and b: there is an edge from node a to node b.

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