题意:给你一幅图,判断是否满足条件:对于图中任意一对点u,v,能够从u走到v,或者从v走到u。
分析:首先强联通缩点,面对缩点后的图,怎么判断是否满足条件呢?我们进行拓扑排序,满足条件的话,每次拓扑删边之后入度为0的点有且只有一个。
代码:
#pragma comment(linker,"/STACK:102400000,102400000")
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long ll; //ŒÇµÃ±ØÒªµÄʱºòžÄ³ÉÎÞ·ûºÅ
const int maxn=250005; //µãÊý
const int maxm=1000005; //±ßÊý
const int INF=1000000000;
struct EdgeNode
{
int from;
int to;
int next;
}edge[maxm];
int head[maxn],cnt;
void add(int x,int y)
{
edge[cnt].from=x;edge[cnt].to=y;edge[cnt].next=head[x];head[x]=cnt++;
//printf("%d %d\n",x,y);
}
void init()
{
cnt=0;
memset(head,-1,sizeof(head));
}
int dfn[maxn],low[maxn],ins[maxn],cixu,scc_count,n,ru[maxn],chu[maxn],sd[maxn];
stack<int>S;
void dfs(int u)
{
int v,x;
dfn[u]=low[u]=++cixu;
S.push(u);
ins[u]=1;
for(int i=head[u];i!=-1;i=edge[i].next)
{
v=edge[i].to;
if(!dfn[v]){
dfs(v);
low[u]=min(low[u],low[v]);
}
else if(ins[v]) //Èç¹ûÒÑŸËѹý£¬²¢ÇÒÔÚÕ»ÀïÃ棬Èç¹û²»ÔÚÕ»ÀïÃ棬˵Ã÷žÃµãÊôÓÚÆäËûµÄÇ¿Á¬Íš·ÖÁ¿ÀïÃæ
low[u]=min(low[u],dfn[v]); //ŽËŽŠlowŽúÌædfnÒ²ÊÇ¿ÉÒԵģ¬µ«ÊÇÔÚtarjanÇóÎÞÏòÍŒµÄʱºò²»ÄÜ
}
if(dfn[u]==low[u]) //±íÊŸuΪŽËÇ¿Á¬Íš·ÖÁ¿µÚÒ»žö±»·¢Ïֵĵ㣬ÊôÓÚžÃÇ¿Á¬Íš·ÖÁ¿µÄËùÓеÄÆäËûµã¶ŒÔÚÕ»ÖУ¬ËûµÄÉÏÃæ
{
scc_count++;
do
{
x=S.top();
S.pop();
sd[x]=scc_count;
ins[x]=0;
}while(x!=u);
}
}
void tarjan()
{
for(int i=1;i<=n;i++)sd[i]=i; //Ëõµã±êŒÇÊý×é
memset(ins,0,sizeof(ins));
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
cixu=scc_count=0;
for(int i=1;i<=n;i++) //¿ÉÄÜËùžøµÄ͌Ϊ²»Á¬ÍšµÄÍŒ£¬·Ö¿é£¬ÒòŽËÐèÒª±éÀúËùÓеĵã
{
if(!dfn[i])
dfs(i);
}
}
void SD()
{
int x,y,len=cnt;
init();
memset(ru,0,sizeof(ru));
memset(chu,0,sizeof(chu));
for(int i=0;i<len;i++){
x=sd[edge[i].from]; y=sd[edge[i].to];
if(x==y)continue;
add(x,y);
chu[x]++; ru[y]++;
}
}
void solve()
{
int i,u,v;
queue<int>Q;
for(i=1;i<=scc_count;i++){
if(ru[i]==0)Q.push(i);
}
while(!Q.empty())
{
if(Q.size()!=1){
printf("No\n");
return;
}
u=Q.front();
Q.pop();
ru[i]--;
for(int i=head[u];i!=-1;i=edge[i].next)
{
v=edge[i].to;
ru[v]--;
if(ru[v]==0)Q.push(v);
}
}
printf("Yes\n");
}
int main()
{
int T,m,i,x,y;
scanf("%d",&T);
while(T--){
init();
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d%d",&x,&y);
add(x,y);
}
tarjan();
SD();
solve();
}
return 0;
}