hdoj 3342 Legal or Not 【拓扑排序判断是否存在可行解】

最新推荐文章于 2019-04-12 22:36:12 发布

笑着走完自己的路

最新推荐文章于 2019-04-12 22:36:12 发布

阅读量477

点赞数

分类专栏：拓扑排序

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/47662541

版权

拓扑排序专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Legal or Not

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 5912 Accepted Submission(s): 2736

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

Sample Output

  
  
   
   YES
NO

题意：有N个人编号从0到N-1，给出M组师徒关系即a是b师徒。问你这N个人之间存不存在师徒辈分混乱的情况。

分析：显然的拓扑排序，而且还是判断可行解的拓扑。直接正向拓扑KO。

#include <cstdio>
#include <cstring>
#include <queue>
#define MAXN 120
#define MAXM 200
using namespace std;
struct Edge
{
    int from, to, next;
};
Edge edge[MAXM];
int head[MAXN], edgenum;
int in[MAXN];
int N, M;
void init()
{
    edgenum = 0;
    memset(head, -1, sizeof(head));
    memset(in, 0, sizeof(in));
}
void addEdge(int u, int v)
{
    int i;
    for(i = head[u]; i != -1; i = edge[i].next)
    {
        if(edge[i].to == v)
            break;
    }
    if(i != -1) return ;
    in[v]++;
    Edge E = {u, v, head[u]};
    edge[edgenum] = E;
    head[u] = edgenum++;
}
void getMap()
{
    int a, b;
    for(int i = 1; i <= M; i++)
    {
        scanf("%d%d", &a, &b);
        a++, b++;
        addEdge(a, b);
    }
}
void solve()
{
    queue<int> Q;
    int num = 0;
    for(int i = 1; i <= N; i++)
        if(in[i] == 0) Q.push(i);
    while(!Q.empty())
    {
        int u = Q.front();
        Q.pop();
        num++;
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].to;
            if(--in[v] == 0)
                Q.push(v);
        }
    }
    if(num == N)
        printf("YES\n");
    else
        printf("NO\n");
}
int main()
{
    while(scanf("%d%d", &N, &M),N||M)
    {
        init();
        getMap();
        solve();
    }
    return 0;
}