P10480 Reachability Statistics

Given a directed acyclic graph (DAG) with $N$ nodes and $M$ edges, count for each node how many nodes can be reached starting from that node.

The first line contains two integers $N, M$. The next $M$ lines each contain two integers $x, y$, representing a directed edge from $x$ to $y$.

Output $N$ lines in total, where each line gives the number of nodes that can be reached from that node.

The testdata satisfies $1 \le N, M \le 30000$, $1 \le x, y \le N$. Translated by ChatGPT 5