hdu—3342 Legal or Not 拓扑图的搜索

最新推荐文章于 2017-11-21 16:30:10 发布

ming_514

最新推荐文章于 2017-11-21 16:30:10 发布

阅读量213

点赞数

分类专栏：暴力

本文链接：https://blog.csdn.net/qq_36819130/article/details/74025200

版权

暴力专栏收录该内容

22 篇文章 0 订阅

订阅专栏

发现自己的读题能力是真的差，这个读了很久，而且还读错了，结果是不存在回路的输出yes我正好弄翻了，这个题就是判断一个有向图，是否存在回路，我是这样想的，先把所有的徒弟存下来，然后去找师傅，找到一个师傅，把他所有和徒弟的那一条路，删除掉，然后再去找一个师傅，最后如果能找完那就是不存在回路，三重循环直接爆的，比赛结束后，他们都说这个至少是个bfs，dfs吧，可能数据有一些水，然后我就直接暴力过了

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

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <math.h>
#include <stack>
#define LL long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 100 + 10;
int dir[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
int m,n;
int g[maxn][maxn];
int vis[maxn];
int k[maxn];
int main()
{
    int x,y;
    while(scanf("%d%d",&n,&m) && (m||n))
    {
        memset(g,0,sizeof(g));
        memset(vis,0,sizeof(vis));
        memset(k,0,sizeof(k));
        for(int i = 0;i < m;i++)
        {
            scanf("%d%d",&x,&y);
             if(g[x][y] == 0)
             {
                 g[x][y] = 1;
                 k[y]++;
             }
        }
        int cur = 0;
        for(int i = 0;i < n;i++)
        {
            for(int j = 0;j < n;j++)
            {
                if(!vis[j] && k[j] == 0)
                {
                    cur++;
                    vis[j] = 1;
                    for(int y = 0;y < n;y++)
                    {
                        if(g[j][y] == 1)
                        {
                            k[y]--;
                        }
                    }
                }
            }
        }
        if(cur < n)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;

    }
    return 0;
}