HDU 3342
2015-08-06 10:57
274 查看
Legal or Not
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5817 Accepted Submission(s): 2696
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.
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
//判环 拓扑
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5817 Accepted Submission(s): 2696
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.
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
//判环 拓扑
#include <stdio.h> #include <string.h> int in[200]; int ma[200][200]; int main() { int n,m; while(~scanf("%d%d",&n,&m)&&(n+m)) { int a,b; memset(in,0,sizeof(in)); memset(ma,0,sizeof(ma)); for(int i=0;i<m;i++) { scanf("%d%d",&a,&b); if(!ma[a][b]) { ma[a][b]=1; in[b]++; } } int flag=0; for(int j=0;j<n;j++) { int k; for(k=0;k<n;k++) if(in[k]==0) break; if(k==n) { flag=1; break; } else { in[k]--; for(int i=0;i<n;i++) if(ma[k][i]==1) in[i]--; } } if(flag) printf("NO\n"); else printf("YES\n"); } return 0; }
相关文章推荐
- 我又回来了!
- UVA - 11584 Partitioning by Palindromes
- Poj 1611 The Suspects
- ruby的Comparable 和Enumerable
- git项目创建
- 当超出宽度时候用省略号,鼠标移动到上面时候显示所有(不用tooltip插件)
- zabbix登录错误
- 表单字段添加索引
- Exchange 2013 管理-兰晓宇-专题视频课程
- HTML <a> 标签 (修改样式,链接邮箱Email地址)
- HDU 2544 最短路 单源Dijkstra
- hdoj.1295 Move Move Look【水题】 2015/08/06
- HDU 2701 Lampyridae Teleportae
- 16. Element contentEditable 属性
- 该登录名来自不受信任的域,不能与 Windows 身份验证一起使用。
- AD管理-兰晓宇-专题视频课程
- 【Cocos2d入门教程三】HelloWorld之一目了然
- ulimit -a详解
- hive DATEDIFF NULL
- sql触发器(insert,update,delete)