杭电-3342Legal or Not(topo)
来源:互联网 发布:淘宝交钱需要交多少钱 编辑:程序博客网 时间:2024/06/06 18:32
Legal or Not
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6283 Accepted Submission(s): 2933
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<cstring>#include<algorithm>using namespace std;int map[110][110],degree[110],m,n;void topo(){int i,j,k,mark;for(i=0;i<m;i++){mark=1;for(j=0;j<m;j++){if(degree[j]==0){mark=0;degree[j]=-1;break;}}if(mark){printf("NO\n");return ;}for(k=0;k<m;k++){if(map[j][k])degree[k]--;}}printf("YES\n");}int main(){int i,j,a,b;while(scanf("%d%d",&m,&n),n){memset(map,0,sizeof(map));memset(degree,0,sizeof(degree));for(i=0;i<n;i++){scanf("%d%d",&a,&b);if(!map[a][b]){map[a][b]=1;degree[b]++;}}int flag=0;for(i=0;i<m;i++)//优化{for(j=0;j<m;j++){if(map[i][j]&&map[j][i]){printf("NO\n");flag=1;break;}}if(flag)break;}if(flag)continue;elsetopo();}return 0;}
0 0
- 杭电-3342Legal or Not(topo)
- 杭电3342Legal or Not
- 杭电3342Legal or Not (拓扑排序)
- Legal or Not HDU杭电3342【拓扑排序】
- 杭电 3342 Legal or Not(拓扑排序)
- 杭电 3342 Legal or Not(拓扑排序)
- Legal or Not 【topo 判定是否有环】
- 3342 Legal or Not
- HDU 3342 Legal or Not
- hdu 3342 Legal or Not
- hdu 3342 Legal or Not
- Hdu 3342 Legal or Not
- hdu 3342 Legal or Not
- hdu 3342 Legal or Not
- hdu 3342 Legal or Not
- hdu-3342 Legal or Not
- HDU 3342 Legal or Not
- HDU 3342 Legal or Not
- 对象关系映射ORM?
- 解决Xcode在debug时不在断点处停止的方法
- Linux下C++访问MySQL数据库
- Java基础之ThreadLocal
- 自定义控件(19)---自定义控件之高仿猫眼小项目(1)
- 杭电-3342Legal or Not(topo)
- win10、win7系统64位oracle11g安装教程以及32位plsql连接教程
- SparkSQL简单测试
- php依赖注入
- OC学习心得之内存管理
- GDAL C# “OSGeo.GDAL.GdalPINVOKE”的类型初始值设定项引发异常 解决方法
- Java 打印三角形
- nyoj 合并游戏 832 (状压DP) 好题
- 如何调试MFC中的内存泄漏