hdu3342-Legal or Not 通过拓扑判断是不是有向环
来源:互联网 发布:mac 破解软件大全 编辑:程序博客网 时间:2024/06/06 07:06
Legal or Not
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4330 Accepted Submission(s): 1930
Problem Description
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.
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.
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".
If it is legal, output "YES", otherwise "NO".
Sample Input
3 20 11 22 20 11 00 0
Sample Output
YESNO#include<cstdio>#include<iostream>#include<cstring>using namespace std;#define N 105int map[N][N];int mycount[N];int n,m,a,b,d;void topo(){ d=0; for(int i=0;i<n;i++) for(int j=0;j<=n;j++) if(map[i][j]) mycount[j]++;//入度初始化 int k; for(int i=0;i<n;i++) { k=0; while(mycount[k]!=0)//查询入度为0的节点 { k++; if(k>=n) //关键,若k=n则为环 { d=1; return; } } mycount[k]=-1;//删除节点 for(int j=0;j<n;j++)//与其有关的点入度减1 { if(map[k][j]) mycount[j]--; } }}int main(){ while(scanf("%d%d",&n,&m)!=EOF&&n) { memset(map,0,sizeof(map)); memset(mycount,0,sizeof(mycount)); for(int i=0;i<m;i++) { scanf("%d%d",&a,&b); map[a][b]=1;//邻接矩阵存图 } topo(); if(d==0) printf("YES\n"); else if(d==1) printf("NO\n"); } return 0;}
0 0
- hdu3342-Legal or Not 通过拓扑判断是不是有向环
- HDU3342 Legal or Not【拓扑排序】【链式前向星】
- hdu3342 Legal or Not(拓扑排序,判环)
- HDU3342 Legal or Not 拓扑排序判环
- hdu3342 Legal or Not 拓扑排序
- Legal or Not(hdu3342拓扑排序)
- hdu3342 Legal or Not (拓扑排序+邻接矩阵)
- hdu3342 Legal or Not---拓扑排序
- HDU3342 Legal or Not 【拓扑排序】
- HDU3342 Legal or Not(拓扑排序)
- hdu3342 Legal or Not(拓扑排序)
- hdu3342 Legal or Not【拓扑排序】
- HDU3342:Legal or Not(拓扑排序)
- HDU3342---Legal or Not(拓扑排序。)
- HDOJ 3342 Legal or Not(拓扑排序判断有向图是否存在环)
- HDU3342---Legal or Not
- HDU3342-Legal or Not
- HDU3342-Legal or Not
- zoj2297Survival (状态压缩DP)
- POJ 1088 滑雪 记忆化优化题解
- 如何在meidastreamer中添加h264编码器
- 【练手小程序——01】迷宫问题
- 大话设计模式1 简单工厂模式 的java代码实现
- hdu3342-Legal or Not 通过拓扑判断是不是有向环
- poj 2115 (数论之扩展欧几里得算法)
- db2codepage=1386
- 关于python文件操作
- oracle产品
- 字节的高低位知识,Ascii,GB2312,UNICODE等编码的关系与来历
- hdu 2566 统计硬币(母函数)
- 动态规划入门戳进来
- linux下svn配置参数详解