HDU 3342 Legal or Not | HDU 5154 (拓扑排序判环)

最新推荐文章于 2019-09-05 16:41:27 发布

你有多高

最新推荐文章于 2019-09-05 16:41:27 发布

阅读量416

点赞数

分类专栏： # ACM/ICPC题解文章标签： HDU 拓扑排序

本文链接：https://blog.csdn.net/MM__1997/article/details/78259853

版权

ACM/ICPC题解专栏收录该内容

166 篇文章 0 订阅

订阅专栏

3342： http://acm.split.hdu.edu.cn/showproblem.php?pid=3342

5154：http://acm.split.hdu.edu.cn/showproblem.php?pid=5154

题目大意：

两个题一样有向图判断是否有环

分析：

拓扑排序

AC代码：

#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include<list>
#include <bitset>
#include <climits>
#include <algorithm>
#define gcd(a,b) __gcd(a,b)
#define FIN		freopen("input.txt","r",stdin)
#define FOUT 	freopen("output.txt","w",stdout)
typedef long long LL;
const LL mod=1e9+7;
const int INF=0x3f3f3f3f;
const double PI=acos(-1.0);
using namespace std;
int head[105],indeg[105];
int cnt;
int n,m;
struct node{
	int next;
	int to;
}edge[105];
void add(int u,int v){
	edge[cnt].to=v;
	edge[cnt].next=head[u];
	head[u]=cnt++;
}
int topo(){
	queue<int> Q;
	for (int i=0;i<n;i++) if (indeg[i]==0) Q.push(i);
	int k=0;
	while (!Q.empty()){
		int u=Q.front();
		Q.pop();k++;
		for (int i=head[u];i!=-1;i=edge[i].next){
			int v=edge[i].to;
			indeg[v]--;
			if (indeg[v]==0) Q.push(v);
		}
	}
	if (k<n) return 0;
	return 1;
}
int main (){
	while (scanf ("%d%d",&n,&m)&&n){
		int x,y;
		memset(indeg,0,sizeof(indeg));
		memset(head,-1,sizeof(head));
		cnt=0;
		for (int i=0;i<m;i++){
			scanf ("%d%d",&x,&y);
			add(x,y);
			indeg[y]++;
		}
		if (topo()) printf ("YES\n");
		else printf ("NO\n");
	}
	return 0;
}

AC代码：

#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include<list>
#include <bitset>
#include <climits>
#include <algorithm>
#define gcd(a,b) __gcd(a,b)
#define FIN		freopen("input.txt","r",stdin)
#define FOUT 	freopen("output.txt","w",stdout)
typedef long long LL;
const LL mod=1e9+7;
const int INF=0x3f3f3f3f;
const double PI=acos(-1.0);
using namespace std;
int head[105],indeg[105];
int cnt;
int n,m;
struct node{
	int next;
	int to;
}edge[10005];
void add(int u,int v){
	edge[cnt].to=v;
	edge[cnt].next=head[u];
	head[u]=cnt++;
}
int topo(){
	queue<int> Q;
	for (int i=1;i<=n;i++) if (indeg[i]==0) Q.push(i);
	int k=0;
	while (!Q.empty()){
		int u=Q.front();
		Q.pop();k++;
		for (int i=head[u];i!=-1;i=edge[i].next){
			int v=edge[i].to;
			indeg[v]--;
			if (indeg[v]==0) Q.push(v);
		}
	}
	if (k<n) return 0;
	return 1;
}
int main (){
	while (scanf ("%d%d",&n,&m)!=EOF){
		int x,y;
		memset(indeg,0,sizeof(indeg));
		memset(head,-1,sizeof(head));
		cnt=0;
		for (int i=0;i<m;i++){
			scanf ("%d%d",&x,&y);
			add(x,y);
			indeg[y]++;
		}
		if (topo()) printf ("YES\n");
		else printf ("NO\n");
	}
	return 0;
}