{"problem":{"name":"可达性统计","description":{"content":"给定一张 $N$ 个点 $M$ 条边的有向无环图，分别统计从每个点出发能够到达的点的数量。","description_type":"Markdown"},"platform":"Luogu","limit":{"time_limit":1000,"memory_limit":524288},"difficulty":{"LuoguStyle":"P3"},"is_remote":true,"is_sync":true,"sync_url":null,"sign":"LGP10480"},"statements":[{"statement_type":"Markdown","content":"给定一张 $N$ 个点 $M$ 条边的有向无环图，分别统计从每个点出发能够到达的点的数量。\n\n## Input\n\n第一行两个整数 $N,M$，接下来 $M$ 行每行两个整数 $x,y$，表示从 $x$ 到 $y$ 的一条有向边。\n\n## Output\n\n输出共 $N$ 行，表示每个点能够到达的点的数量。\n\n[samples]\n\n## Note\n\n测试数据满足 $1 \\le N,M \\le 30000$，$1 \\le x,y \\le N$。","is_translate":false,"language":"English"}],"meta":{"iden":"LGP10480","tags":["拓扑排序","位运算","bitset"],"sample_group":[["10 10\n3 8\n2 3\n2 5\n5 9\n5 9\n2 3\n3 9\n4 8\n2 10\n4 9","1\n6\n3\n3\n2\n1\n1\n1\n1\n1"]],"created_at":"2026-03-03 11:09:25"}}