hiho一下 第四十七周（拓扑排序）47

---

///
作者：tt267
声明：本文遵循以下协议自由转载-非商用-非衍生-保持署名|Creative Commons BY-NC-ND 3.0
转载请注明：http://blog.csdn.net/tt2767/article/details/46364641
///

---

题目链接：http://hihocoder.com/problemset/problem/1174
提示里面解释的很详细了，代码如下：

#include<iostream>
#include<algorithm>
#include <iterator>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<functional>
#include<stdlib.h>
#include<cstring>
using namespace std;
#define PI acos(-1.0)

vector<int> Graph[100009];
queue<int> que;
int V,E;
int deg[100009] = {0};

bool solve();

int main()
{
    int Case;
    int a, b;
    scanf("%d",&Case);
    while(Case--)
    {
        memset(deg,0,sizeof(deg));
        scanf("%d%d",&V,&E);
        for(int i = 1 ; i <= V ;i++ )
            Graph[i].clear();
        for(int i = 0; i < E ;i++ )
        {
            scanf("%d%d",&a,&b);
            Graph[a].push_back(b);
            deg[b]++;
        }

        puts(solve()?"Correct":"Wrong");
    }
    return 0;
}

bool solve()
{
    int x;
    for(int i = 1 ; i <= V ;i++ )
        if(deg[i] == 0)
            que.push(i);

    while(!que.empty())
    {
        x = que.front(); que.pop();
        for(vector<int>::iterator it = Graph[x].begin() ; it != Graph[x].end() ; it++)
        {
            if( !deg[*it] )
                continue;
            deg[*it]--;
            if( !deg[*it] )
                que.push(*it);
        }
    }

    for(int  i = 1 ; i <= V ; i++)
        if(deg[i])
            return false;
    return true;
}