HDU3342:Legal or Not(拓扑排序)
来源:互联网 发布:单片机时序图 编辑:程序博客网 时间:2024/06/07 00:20
Legal or Not
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8903 Accepted Submission(s): 4147
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
Source
HDOJ Monthly Contest – 2010.03.06
题意:给N个人,M个上下级关系,关系具有传递性,问是否存在冲突的情况。思路:就是相当于判断有向图有无有向环,那么经过的点vis下就好了,然后加边时拓扑排序那样,入度变0才加进队列,就不会误判了。
# include <iostream># include <cstdio># include <cstdlib># include <cstring># include <vector># define pb push_backusing namespace std;const int maxn = 1e2+30;int n, a[maxn], in[maxn], q[maxn<<1];vector<int>v[maxn];int ans;void solve(){ ans = 0; int icount = 0, l=0, r=0; for(int i=0; i<n; ++i) if(in[i] == 0) q[r++] = i, a[i] = 1, ++icount; if(icount == 0) {ans = -1;return;} while(l<r) { int u = q[l++]; for(int i=0; i<v[u].size(); ++i) { if(in[v[u][i]] == 0){ans = -1;return;} if(--in[v[u][i]] == 0) { a[v[u][i]] = 1; ++icount; q[r++] = v[u][i]; } } } if(icount < n) ans = -1;}int main(){ int m; while(~scanf("%d%d",&n,&m),m+n) { memset(a, 0, sizeof(a)); memset(in, 0, sizeof(in)); for(int i=0; i<n; ++i) v[i].clear(); while(m--) { int a, b; scanf("%d%d",&a,&b); v[a].pb(b); ++in[b]; } solve(); printf("%s\n",ans==-1?"NO":"YES"); } 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 拓扑排序判环
- hdu3342 Legal or Not(简单拓扑排序判定)
- hdu3342(Legal or Not)----- 学习拓扑排序的好例题
- HDU3342---Legal or Not
- HDU3342-Legal or Not
- Python —— 深拷贝 VS 浅拷贝
- Impala 5、Impala 性能优化
- JAVA环境的配置与安装
- HDU 6070 Dirt Ratio
- HDU-6078 Wavel Sequence(dp+树状数组)
- HDU3342:Legal or Not(拓扑排序)
- I
- 盒子模型和box-sizing属性
- 多个ASP.NET站点如何通过ASP.NET State服务共享Session会话
- 暑假集训日记--8.3--搜索
- CSS命名实践
- bzoj 3441: 乌鸦喝水(说实话有生之年没有见过这么难的模拟)
- [剑指offer]矩形覆盖
- [PAT乙级]1040. 有几个PAT(25)