Legal or Not 【topo 判定是否有环】
来源:互联网 发布:中国产业安全数据 编辑:程序博客网 时间:2024/06/07 11:46
ACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,many “holy cows” like HH, hh, AC, ZT, lcc, BF, Qinz and so on chat on-line to exchange their ideas. When someone has questions, many warm-hearted cows like Lost will come to help. Then the one being helped will call Lost “master”, and Lost will have a nice “prentice”. By and by, there are many pairs of “master and prentice”. But then problem occurs: there are too many masters and too many prentices, how can we know whether it is legal or not?
We all know a master can have many prentices and a prentice may have a lot of masters too, it’s legal. Nevertheless,some cows are not so honest, they hold illegal relationship. Take HH and 3xian for instant, HH is 3xian’s master and, at the same time, 3xian is HH’s master,which is quite illegal! To avoid this,please help us to judge whether their relationship is legal or not.
Please note that the “master and prentice” relation is transitive. It means that if A is B’s master ans B is C’s master, then A is C’s master.
Input
The input consists of several test cases. For each case, the first line contains two integers, N (members to be tested) and M (relationships to be tested)(2 <= N, M <= 100). Then M lines follow, each contains a pair of (x, y) which means x is y’s master and y is x’s prentice. The input is terminated by N = 0.
TO MAKE IT SIMPLE, we give every one a number (0, 1, 2,…, N-1). We use their numbers instead of their names.
Output
For each test case, print in one line the judgement of the messy relationship.
If it is legal, output “YES”, otherwise “NO”.
Sample Input
3 2
0 1
1 2
2 2
0 1
1 0
0 0
Sample Output
YES
NO
给定一个有向图,问其中是不是有环,
裸topo
看代码
#include<stdio.h>#include<string.h>#include<queue>using namespace std;const int MAXN =2000+100;const int MAXM=1000000;vector<int>G[MAXN];int n,m;int in[MAXN];void init(){ for(int i=0;i<=n;i++) { G[i].clear(); in[i]=0; }}void getmap(){ int a,b; while(m--){ scanf("%d%d",&a,&b); G[a].push_back(b); in[b]++; }}bool topo(){ queue<int>Q; for(int i=0;i<n;i++) if(in[i]==0) Q.push(i); int num=0; while(!Q.empty()){ int now=Q.front();Q.pop();num++; for(int i=0;i<G[now].size();i++){ if(--in[G[now][i]]==0) Q.push(G[now][i]); } } return num!=n;}int main(){ while(scanf("%d%d",&n,&m)&&(n||m)){ init(); getmap(); printf("%s\n",!topo()?"YES":"NO"); }}
- Legal or Not 【topo 判定是否有环】
- 杭电-3342Legal or Not(topo)
- HDOJ 3342 Legal or Not(拓扑排序判断有向图是否存在环)
- Legal or Not 3342 (拓扑排序 是否生成环)
- HDU 3342 Legal or Not(简单拓扑排序判定)
- hdu3342 Legal or Not(简单拓扑排序判定)
- Legal or Not
- Legal or Not HDU
- TOJ3650 Legal or Not
- C - Legal or Not
- Legal or Not
- Legal or Not
- HDU3342---Legal or Not
- Legal or Not
- Legal or Not
- Legal or Not
- 3342 Legal or Not
- Legal or Not
- 关于diango--python的web开发
- 杭电acm 1259ZJUTACM(简单题)
- iOS应用性能调优的25个建议和技巧
- C语言编译lib库手动添加
- 栈的应用:中缀和后缀表达式的转换及计算
- Legal or Not 【topo 判定是否有环】
- 日常小记
- 机器学习-sklearn逻辑回归分析
- 学习笔记——JavaEE基础<2>javascript基础
- 剑指offer 面试题58 二叉树的下一个结点
- 修改开机启动脚本、修改IP
- MyEclipse使用Maven创建web项目+搭建SSM框架教
- Lua 字符串实践 -- 过滤词库算法
- 队列和循环队列的实现