拓扑排序 HDU 3342
来源:互联网 发布:百乐88g钢笔淘宝假货 编辑:程序博客网 时间:2024/05/21 00:15
Legal or Not
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4555 Accepted Submission(s): 2072
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 <stdio.h>#include <stdlib.h>#include <malloc.h>#include <limits.h>#include <ctype.h>#include <string.h>#include <string>#include <math.h>#include <algorithm>#include <iostream>#include <queue>#include <stack>#include <deque>#include <vector>#include <set>#include <map>using namespace std;#define MAXN 600int head[MAXN];int into[MAXN];//int mark[MAXN];struct node{ int to; int next;}edge[600];int main(){ int n,m; int i,j; while(~scanf("%d%d",&n,&m)){ if(n==0 && m==0){ break; } memset(into,0,sizeof(into)); memset(head,-1,sizeof(head)); int k = 0; while(m--){ scanf("%d%d",&j,&i); edge[k].to = i; edge[k].next = head[j]; head[j] = k++; into[i]++; } queue<int>t; for(i=0;i<n;i++){ if(into[i] == 0){ t.push(i); } } int count = 0; while(!t.empty()){ int u = t.front(); count++; t.pop(); for(k=head[u];k!=-1;k=edge[k].next){ if(--into[edge[k].to] == 0){//--的位置注意 t.push(edge[k].to); } } } if(count == n){ printf("YES\n"); } else{ printf("NO\n"); } } return 0;}
0 0
- HDU 3342 拓扑排序
- hdu 3342 拓扑排序
- HDU 3342 拓扑排序
- hdu 3342 拓扑排序
- hdu 3342 拓扑排序
- 拓扑排序 HDU 3342
- hdu 3342 拓扑排序
- hdu 3342 拓扑排序
- HDU 3342 拓扑排序
- hdu 3342 拓扑排序
- HDU 3342 拓扑排序
- hdu 3342(拓扑排序)
- hdu 3342 拓扑排序 水
- hdu 3342(拓扑排序)
- hdu 3342(拓扑排序)
- hdu 3342 拓扑排序模板题
- 【拓扑排序】hdu 3342 Legal or Not
- 【HDU】3342 Legal or Not 拓扑排序
- 【Twitter Storm系列】flume-ng+Kafka+Storm+HDFS 实时系统搭建
- 蒙特卡罗和重要性采样
- Android应用截图和SurfaceView截图问题总结
- hdu-oj 矩形A + B
- 我的异常网 » Java Web开发 » 验证码跟session不同步
- 拓扑排序 HDU 3342
- Java设计模式--工厂模式
- 习近平提从严治党8点要求:不留暗门 不开天窗
- css基础
- Android判断应用程序是否安装和版本号
- #ifndef
- const限定修饰符用法总结(常量,指针,迭代器,函数参数,成员函数)
- Java AES加密实现
- ACM Splay(模板)