poj 2762 Going from u to v or from v to u?

题目链接:http://poj.org/problem?id=2762

题目大意:判断该图是否是单连通图(任意取两点a,b必然有a->b或b->a或a<->b).

题目思路:先把每一个点的入度求出.
寻找是否有入度为0的点,
如果没有:该图肯定是强连通的(必然也是单连通).
如果有且不止一个:因为从其中随便算两个入度为0的点,它们肯定不可互达.
如果有且只有一个:把该点入度置为-1(或者一个很大的数)并把和该点相邻的且该点为出方向的点的入度减一(其实就是把该点从图中删去),之后循环上诉步骤.

代码:

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <time.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

#define ull unsigned __int64
//#define ll __int64
//#define ull unsigned long long
#define ll long long
#define son1 New(p.xl,xm,p.yl,ym),(rt<<2)-2
#define son2 New(p.xl,xm,min(ym+1,p.yr),p.yr),(rt<<2)-1
#define son3 New(min(xm+1,p.xr),p.xr,p.yl,ym),rt<<2
#define son4 New(min(xm+1,p.xr),p.xr,min(ym+1,p.yr),p.yr),rt<<2|1
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define middle (l+r)>>1
#define MOD 1000000007
#define esp (1e-8)
const int INF=0x3F3F3F3F;
const double DINF=10000.00;
//const double pi=acos(-1.0);
const int M=6010;
int min(int x,int y){return x<y? x:y;}
int max(int x,int y){return x>y? x:y;}
void swap(int& x,int& y){int t=x;x=y;y=t;}
int T,cas;

struct node{int v,next;}edge[M<<1];
int init[M];
int n,m,len;
int In[M];

bool judge(){
	int u,v,i,tot=0,cnt;
	while(tot<=n){
		cnt=0;
		for(i=1;i<=n;i++) if(!In[i]) u=i,cnt++;
		if(!cnt) return true;
		if(cnt>1) return false;
		for(i=init[u];i!=-1;i=edge[i].next) v=edge[i].v,In[v]--;
		In[u]=-1;
		tot++;
	}
	return true;
}

void _init(){
	scanf("%d%d",&n,&m);
	memset(init,-1,sizeof(int)*(n+1));
	memset(In,0,sizeof(int)*(n+1));
	int u;
	for(len=1;len<=m;len++){
		scanf("%d%d",&u,&edge[len].v);
		edge[len].next=init[u],init[u]=len;
		In[edge[len].v]++;
	}
}

void _sof(){
	printf("%s\n",judge()? "Yes":"No");
}

int main(){
	//freopen("1.in","r",stdin);
	//freopen("1.out","w",stdout);
	//_init(),_sof();
	scanf("%d",&T);for(cas=1;cas<=T;cas++) _init(),_sof();
	//while(~scanf("%d",&k)){for(int i=0;i<k;i++) _init(),_sof();}
	return 0;
}