hdu 3342 Legal or Not
来源:互联网 发布:高德端口修改工具 编辑:程序博客网 时间:2024/05/17 02:08
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2267 Accepted Submission(s): 1010
Total Submission(s): 2267 Accepted Submission(s): 1010
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
题意 :一个可以有多个师傅,或者多个徒弟。 师傅的师傅的一样是自己的师傅,徒弟的徒弟的,一样是自己的徒弟。 但是一个人不能即是一个人的师傅,也是这个人的徒弟。
问 如果存在这种混乱关系的,就输出NO, 否则输出 YES.
思路 : 建立有向图, 若有回路, 即输出NO, 否则输出YES.
floyd() 找最短路, 若存在两城市互相相通, a[i][j] != max && a[j][i] != max && i != j
#include <stdio.h>#define max_size 105#define max 10001int main() { int i, j, k, n, m, a, b, num[max_size][max_size]; while(scanf("%d", &n) && n) { scanf("%d", &m); for(i = 0; i < n; ++i) for(j = 0; j < n; ++j) { if(i == j) num[i][j] = 0; else num[i][j] = max; } while(m--) { scanf("%d%d", &a, &b); num[a][b] = 1; } for(k = 0; k < n; ++k) for(i = 0; i < n; ++i) { if(num[i][k] != max) { for(j = 0; j < n; ++j) if(num[i][j] > num[i][k] + num[k][j]) num[i][j] = num[i][k] + num[k][j]; } } for(i = 0; i < n; ++i) for(j = 0; j < n; ++j) if(i != j && num[i][j] != max && num[j][i] != max) { i = n + 1; break; } if(i == n) printf("YES\n"); else printf("NO\n"); }}
- 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
- 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
- Android学习笔记(24) --- 字体加粗问题
- IT的商业智能(BI)
- 又见一帘幽梦
- Acegi框架介绍
- 社交媒体上的毁与誉
- hdu 3342 Legal or Not
- Linux内存管理基本概念
- upd通信代码-windows版
- 9月编程语言排行榜:Java并不应该被取代
- OCP-043 alter diskgroup add template
- Ubuntu命令行下安装、卸载、管理软件包的方法
- Kinect到底如何识别人脸
- windows下,使用netbeans远程连接solaris11开发C++,并且使用DTrace工具
- 从头学Android之Android的数据存储--SharedPreferences