Problem 882 · Hard

Reachable Nodes In Subdivided Graph

Dijkstra over original nodes, then count how many subdivision nodes each edge lends from both ends.

Open the interactive visualisation