十分残念的博客

1804: 有向无环图Time Limit: 5 Sec  Memory Limit: 128 MBSubmit: 205  Solved: 90[Submit][Status][Web Board]DescriptionBobo 有一个 n 个点，m 条边的有向无环图（即对于任意点 v，不存在从点 v 开始、点 v 结束的路径）。为了方便，点用 1,2,…,n

D. Directed Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon has exp

Query on a graphTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 325    Accepted Submission(s): 73Problem DescriptionYou are given a

传送门：HDU-6073xjb拓扑一下把只有一条边的点去掉，然后dfs一下就行，中间TLE到怀疑人生，重写一遍就AC了，现在已经不想知道到底哪有问题了#includeusing namespace std;typedef long long LL;const int mod = 998244353;const int MX = 300000 + 10;struct Edge {