zoukankan      html  css  js  c++  java
  • hdu 3342 Legal or Not (topsort)

    Legal or Not
    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 11170    Accepted Submission(s): 5230

    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.
     
    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.
     
    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

    C/C++:

     1 #include <map>
     2 #include <queue>
     3 #include <cmath>
     4 #include <vector>
     5 #include <string>
     6 #include <cstdio>
     7 #include <cstring>
     8 #include <climits>
     9 #include <iostream>
    10 #include <algorithm>
    11 #define INF 0xffffff
    12 using namespace std;
    13 
    14 const int my_max = 205;
    15 int n, m, a, b, my_indeg[my_max];
    16 vector <int> my_G[my_max];
    17 
    18 void topsort()
    19 {
    20     int my_cnt = 0;
    21     while (1)
    22     {
    23         int temp = -1;
    24         for (int i = 0; i < n; ++ i)
    25             if (my_indeg[i] == 0)
    26             {
    27                 temp = i, my_cnt ++, my_indeg[i] = -1;
    28                 break;
    29             }
    30 
    31         if (temp == -1) break;
    32         for (int i = 0; i < my_G[temp].size(); ++ i)
    33             -- my_indeg[my_G[temp][i]];
    34         my_G[temp].clear();
    35     }
    36 
    37     if (my_cnt == n)
    38         printf("YES
    ");
    39     else
    40     {
    41         for (int i = 0; i < n; ++ i)
    42             my_G[i].clear();
    43         printf("NO
    ");
    44     }
    45 }
    46 
    47 int main()
    48 {
    49     while (~scanf("%d%d", &n, &m), n || m)
    50     {
    51         memset(my_indeg, 0, sizeof(my_indeg));
    52         while (m --)
    53         {
    54             scanf("%d%d", &a, &b);
    55             ++ my_indeg[a];
    56             my_G[b].push_back(a);
    57         }
    58 
    59         topsort();
    60     }
    61     return 0;
    62 }
  • 相关阅读:
    vue_ajax-axios的使用
    laravel验证码扩展包gregwar/captcha的使用
    如何让你的网页变为黑白色
    laravle Str::random(num)函数
    laravel_日志查看-logViewer工具的使用
    如何自定义css的鼠标样式
    公鸡3块钱1只,母鸡5块钱1只,小鸡1块钱3只,用100块买100只鸡,一共多少种买法,分别是什么?
    假设某人有100000现金。 每经过一次路口需要进行一次交费。 交通规则为为当他现金大于50000时每次需要交5%如果现金小于等于50000时每次交5000。 请写一程序计算此人可以经过多少次这个路口
    本周总结
    本周总结
  • 原文地址:https://www.cnblogs.com/GetcharZp/p/9458837.html
Copyright © 2011-2022 走看看