Hi,

An old problem from Div2 (237) https://codeforces.me/problemset/problem/404/C asks to construct a graph when distances from a vertex are given.

The solutions and editorial to this problem indicate that we should be searching for nodes that are at dist[u] + 1 for a given node u and there should at least be one such node. But if we have distances = [0, 1, 4], then a tree like this 1-(1)->2-(3)->3 also satisfies the conditions in the question and there is no node at a distance of 2 from 1. Can anyone please help he understand what am I missing here?

Thanks!