强连通
萧瑟1
这个作者很懒,什么都没留下…
展开
-
HDU 1269 迷宫城堡 两次dfs
为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的,即:对于任意的i和j,至少存在一条路径可以从房间i到房间j,...原创 2018-09-02 15:51:53 · 152 阅读 · 0 评论 -
POJ 3180 The Cow Prom targan+缩点
The N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dressed in their finest gowns, complete with corsages and new shoes. They know that tonight they will each try to perform ...原创 2018-09-11 14:53:10 · 149 阅读 · 0 评论 -
HDU 2186 Proving Equivalences targan+缩点
Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell...原创 2018-09-11 17:06:16 · 181 阅读 · 0 评论 -
HDU 2767 Proving Equivalences targan+缩点
Consider the following exercise, found in a generic linear algebra textbook.Let A be an n × n matrix. Prove that the following statements are equivalent:1. A is invertible.2. Ax = b has exactly one...原创 2018-09-08 14:06:55 · 183 阅读 · 0 评论 -
codeforces 999E Reachability from the Capital targan+缩点
There are nn cities and mm roads in Berland. Each road connects a pair of cities. The roads in Berland are one-way.What is the minimum number of new roads that need to be built to make all the citie...原创 2018-09-09 16:51:06 · 222 阅读 · 0 评论 -
POJ 1236 Network of Schools targan+缩点
A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes software (the “receiving sc...原创 2018-09-10 21:12:19 · 125 阅读 · 0 评论