Courier Convoys — Solution & Editorial

Back to the Problem

By Menger's theorem this is a max flow with every edge capacity 1.

Complexity: O(E√E) with Dinic on unit capacities