Legal or Not
来源:互联网 发布:网络安全法公安机关 编辑:程序博客网 时间:2024/06/07 01:59
Legal or Not
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 11 Accepted Submission(s) : 8
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
Author
QiuQiu@NJFU
代码如下:
#include <iostream>#include <cstdio>#include <vector>#include <algorithm>using namespace std;int vis[120];int indegree[120];int head[120];int n , m ;typedef struct{ int from ; int to ;}node;vector<node>edge;void init(){ edge.clear(); for(int i = 0; i < 120; i ++) { indegree[i] = 0; vis[i] = 0; head[i] = -1; }}bool cmp(node a , node b){ if(a.from == b.from ) return a.to < b.to ; return a.from < b.from ;}void input(){ node temp; for(int i = 0;i < m; i ++) { scanf("%d%d",&temp.from,&temp.to); indegree[temp.to] ++; edge.push_back(temp); } sort(edge.begin() , edge.end() , cmp); head[edge[0].from] = 0; for(int i = 1; i < (int)edge.size(); i ++) { if(edge[i].from != edge[i-1].from) head[edge[i].from] = i; }}void topu(){ int u ; for(int i = 0; i < n; i ++) { u = -1; for(int j = 0; j < n; j ++) { if(!vis[j] && indegree[j] == 0) { u = j ; break; } } //cout << "u == "<<u << endl; if(u == -1) { printf("NO\n"); return ; } vis[u] = 1; for(int j = head[u]; edge[j].from == u && j < (int)edge.size(); j ++) { indegree[edge[j].to] --; } } printf("YES\n");}int main(){ while(scanf("%d%d",&n , &m),n) { init(); input(); topu(); } return 0;}
0 0
- 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
- Legal or Not(HDU_3342)
- HDU3342-Legal or Not
- HDU3342-Legal or Not
- hdu Legal or Not
- legal or not
- Legal or Not HDU
- 黑马程序员-有关包装类的总结
- 黑马程序员-有关Collection的总结
- 第四、五周作业
- 网络121第5周实验——GUI编程及JDK API的使用
- java多线程回顾(一)
- Legal or Not
- Web编程学习七:使用JPA + RESTful Web Service + SAPUI5来创建Web应用
- Ruby中的绑定和eval
- 第三周作业2
- 黑马程序员—网络编程入门基础
- From《Expert C Programming》01
- 15 Linux更改权限解决新建用户不能读写创建文件/文件夹的问题
- Web编程学习八:通过Apache Cordova将Web应用移动化
- 选择排序 自己终于会写了