http://acm.hdu.edu.cn/showproblem.php?pid=1269
为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的,即:对于任意的i和j,至少存在一条路径可以从房间i到房间j,也存在一条路径可以从房间j到房间i。
#include <cstdio>
#include <iostream>
#include <cstring>
#define MAXN 10010
using namespace std;
int first[MAXN], stack[MAXN], DFN[MAXN], Low[MAXN];
int instack[10010];
int n, m, cnt, scnt, top, tot;
struct node
{
int v,next;
}edge[100010];
void Tarjan(int v)
{
int t;
DFN[v] = Low[v] = ++cnt;
instack[v] = 1;
stack[top++] = v;
for (int i = first[v]; i != -1; i = edge[i].next)
{
int j =edge[i].v;
if(!DFN[j])
{
Tarjan(j);
Low[v] = min(Low[v],Low[j]);
}
else if(instack[j]&&DFN[j] < Low[v])
Low[v] = DFN[j];
}
if(DFN[v] == Low[v])
{
scnt++;
do
{
t = stack[--top];
instack[t] = 0;
}while(t != v);
}
}
void rep(int u, int v)
{
edge[tot].v = v;
edge[tot].next = first[u];
first[u] = tot++;
}
int main()
{
int n,m;
while(cin >>n >>m)
{
if(n == 0 && m == 0)
break;
scnt = top = tot = cnt = 0;
memset(first,-1,sizeof(first));
memset(DFN,0,sizeof(DFN));
while(m--)
{
int u,v;
scanf("%d%d",&u,&v);
rep(u,v);
}
for (int i = 1 ; i <= n ;i++)
if(!DFN[i])
Tarjan(i);
if(scnt == 1)
cout << "Yes\n";
else
cout << "No\n";
}
}