题目连接
http://acm.hdu.edu.cn/showproblem.php?pid=3342
Legal or Not
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 leq N, M leq 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
拓扑排序。。
1 #include<algorithm> 2 #include<iostream> 3 #include<cstdlib> 4 #include<cstring> 5 #include<cstdio> 6 #include<vector> 7 #include<queue> 8 #include<map> 9 using std::cin; 10 using std::cout; 11 using std::endl; 12 using std::find; 13 using std::sort; 14 using std::map; 15 using std::pair; 16 using std::queue; 17 using std::vector; 18 using std::multimap; 19 #define pb(e) push_back(e) 20 #define sz(c) (int)(c).size() 21 #define mp(a, b) make_pair(a, b) 22 #define all(c) (c).begin(), (c).end() 23 #define iter(c) decltype((c).begin()) 24 #define cls(arr,val) memset(arr,val,sizeof(arr)) 25 #define cpresent(c, e) (find(all(c), (e)) != (c).end()) 26 #define rep(i, n) for (int i = 0; i < (int)(n); i++) 27 #define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i) 28 const int N = 10010; 29 typedef unsigned long long ull; 30 struct Node { int to, next; }; 31 struct TopSort { 32 Node G[N]; 33 int tot, topNum, inq[N], head[N]; 34 inline void init() { 35 tot = topNum = 0; 36 cls(inq, 0), cls(head, -1); 37 } 38 inline void add_edge(int u, int v) { 39 G[tot].to = v; G[tot].next = head[u]; head[u] = tot++; 40 } 41 inline void built(int m) { 42 int u, v; 43 rep(i, m) { 44 scanf("%d %d", &u, &v); 45 inq[v]++; 46 add_edge(u, v); 47 } 48 } 49 inline void bfs(int n) { 50 queue<int> q; 51 rep(i, n) { if (!inq[i]) q.push(i); } 52 while (!q.empty()) { 53 int u = q.front(); q.pop(); 54 topNum++; 55 for (int i = head[u]; ~i; i = G[i].next) { 56 if (--inq[G[i].to] == 0) q.push(G[i].to); 57 } 58 } 59 puts(topNum == n ? "YES" : "NO"); 60 } 61 }work; 62 int main() { 63 #ifdef LOCAL 64 freopen("in.txt", "r", stdin); 65 freopen("out.txt", "w+", stdout); 66 #endif 67 int n, m; 68 while (~scanf("%d %d", &n, &m), n + m) { 69 work.init(); 70 work.built(m); 71 work.bfs(n); 72 } 73 return 0; 74 }