zoukankan      html  css  js  c++  java
  • Legal or Not ,图的拓扑

    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.

    输入:

    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.

    输出:

    For each test case, print in one line the judgement of the messy relationship.If it is legal, output "YES", otherwise "NO".

    样例输入:
    3 2
    0 1
    1 2
    2 2
    0 1
    1 0
    0 0
    
    样例输出:
    YES
    NO
    

    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    #include<vector>
    #include<stack> 
    using namespace std;
    
    vector<int> edge[101];
    stack<int> s;
    int main(){
        int m,n;
        int in[101];
        while (cin>>n>>m && !(n==0&&m==0)){
            
            for (int i=0;i<n;i++){
                in[i]=0;
                edge[i].clear();
            }
            int x,y;
            while(m--){
                cin>>x>>y;
                in[y]++;
                edge[x].push_back(y);
            }
            
            while(!s.empty()) s.pop();
            
            for (int i=0;i<n;i++){
                if (in[i] == 0)
            s.push(i);
            }
            
            int ans=0;
            while (!s.empty()){
                int temp=s.top();
                s.pop();
                ans++;
                for (int i=0;i<edge[temp].size();i++){
                    in[edge[temp][i]]--;
                    if (in[edge[temp][i]] == 0)
                    s.push(edge[temp][i]);
                }
            }
            if (ans==n)
            cout<<"YES"<<endl;
            else
            cout<<"NO"<<endl;
            
        }
        
        return 0;
    }

    一个大错误:一直wa,跟答案比对了很久,难道只因为我用了栈他用了队列?

    不相信玄学,继续找

    发现是判断输入的m和n是不是0那里出错了,之前的好几道题自己都这么写,并没有错,但是这道就错了

    不应该是cin>>n>>m && n!=0&&m!=0而是cin>>n>>m && !(n==0&&m==0)

    ╮(╯▽╰)╭

  • 相关阅读:
    [Codevs 1230]元素查找(手写哈希表)
    bat+sqlcmd 批量执行脚本
    为Redmine的项目加上起止时间
    SDUT 1068-Number Steps(数学:直线)
    对象间的联动--观察者模式
    《千与千寻》给读者带来了什么?
    二叉树中和为某一值的路径
    关于Win8 用不了USB转串口驱动
    Android Socket编程学习笔记
    java中的正则操作总结
  • 原文地址:https://www.cnblogs.com/yexiaoqi/p/7236449.html
Copyright © 2011-2022 走看看