zoukankan      html  css  js  c++  java
  • HDUOJ----3342Legal or Not

    Legal or Not

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3454    Accepted Submission(s): 1569


    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
     
    Author
    QiuQiu@NJFU
     
    Source
     
    简单的拓扑排序。。。。
    本题的思路直接球有没有拓扑图是否成唤,即可 。。。
    代码:
     1 /*@coder 龚细军*/
     2 #include<stdio.h>
     3 #include<string.h>
     4 #define maxn 100
     5 bool rea[maxn][maxn] ;   /*rea--->realationship*/
     6 int inde[maxn];          /*inde---->indegree*/
     7 int n,m;
     8 void tp_sort()
     9 {
    10     int i,j,k;
    11     for(i=0;i<n;i++)
    12     {
    13         for(j=0;j<n;j++)
    14         {
    15             if(inde[j]==0)
    16             {
    17                 inde[j]--;
    18                 for(k=0;k<n;k++)
    19                 {
    20                     if(rea[k][j])
    21                     {
    22                         inde[k]--;
    23                     }
    24                 }
    25                 break;
    26             }
    27         }
    28         if(j==n)
    29         {
    30             printf("NO
    ");
    31             return ;
    32         }
    33     }
    34     printf("YES
    ");
    35     return ;
    36 }
    37 
    38 int main()
    39 {
    40 
    41     int a,b;
    42     while(scanf("%d%d",&n,&m),n+m)
    43     {
    44         memset(rea,0,sizeof(rea));
    45         memset(inde,0,sizeof(inde));
    46         while(m--)
    47         {
    48            scanf("%d%d",&a,&b);
    49            if(!rea[a][b])       /*a-->b*/
    50            {
    51                rea[a][b]=true;
    52                inde[a]++;     
    53            }
    54         }
    55         tp_sort();
    56     }
    57     return 0;
    58 }
    View Code
  • 相关阅读:
    《怎样解题》-波利亚
    BZOJ2631 tree
    BZOJ3669 [Noi2014]魔法森林
    BZOJ 2049 [Sdoi2008]Cave 洞穴勘测
    BZOJ2002 [Hnoi2010]Bounce 弹飞绵羊
    动态树入门
    树链剖分入门-Hdu3966 Aragorn's Story
    BZOJ1146 [CTSC2008]网络管理Network
    树的表示方法
    树状数组
  • 原文地址:https://www.cnblogs.com/gongxijun/p/3495417.html
Copyright © 2011-2022 走看看