848. 有向图的拓扑序列

#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;

const int N = 100010;

int n, m;

int q[N], d[N];//q[N]是将入度为0的点存入队列，d[N]表示点的入度数量。

int h[N], e[N],ne[N],idx;

void add(int a, int b)
{
    e[idx] = b, ne[idx] =h[a], h[a] = idx ++;
}

bool topsort()
{
    int hh = 0 , tt = -1;
    //将入度为0的点存入
    for(int i = 1; i <= n; i ++)
    {
        if(!d[i]) q[++ tt] = i;
    }
    
    while(hh <= tt)
    {
        int t = q[hh ++];
        for(int i = h[t]; i != -1; i = ne[i])
        {
            int j = e[i];
            d[j] --;
            if(d[j] == 0) q[++ tt] = j;
        }
    }
    return tt == n - 1;
}

int main()
{
    cin >> n >> m;
    
    memset(h, -1, sizeof h);
    
    while(m --)
    {
        int a,b;
        cin >> a >> b;
        
        add(a, b);
        d[b] ++;
    }
    
    if(topsort())
    {
        for(int i = 0; i < n; i ++) cout << q[i] <<' ';
    }
    
    else cout << -1;
}//来自acwing