Labeling Balls POJ - 3687 优先队列 + 反向拓扑

优先队列 + 反向拓扑

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
const int maxn = 1e5 + ;
int n, m;
vector<int>G[maxn];
int inDeg[maxn];
int dp[maxn];
int cnt;
int sum ,ans ;
int mp[][];
bool topsort()
{
    //queue<int>q;
    priority_queue<int>q;
    //queue<int>q;
    cnt = ;
    sum = ;
    while(!q.empty())q.pop();
    for(int i = ; i <= n ; i++) if(!inDeg[i]) q.push(i);
    while(!q.empty())
    {
        int now = q.top();
        q.pop();
      //  cout << now << endl;
      sum ++;
        dp[now] = n--;
      //  cout << dp[now] << endl;
        for(int i = ; i < G[now].size(); i++)
        {
            int to = G[now][i];
            inDeg[to]--;
            if(!inDeg[to]) q.push(to);
        //    dp[to] = max(dp[to],dp[now] + G[now][i].second);
        }

    }
if(sum == ans)return ;
else return ;
}

int main()
{
    int t;
    ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();
  //  cin >> t;
     cin >> t;
     while(t--){

        cin >> n >> m;
        ans = n;
        memset(inDeg,,sizeof inDeg);
        memset(dp,,sizeof dp);
        for(int i = ; i <= n ; i++) G[i].clear();
        while(m--)
        {
            int u, v, w;
            cin >> u >> v ;

            //if(mp[u][v] == 0)
            G[v].push_back(u);

            //G[v].push_back(make_pair((u,w)));
            inDeg[u] ++;
        }
        if(topsort())
        //int maxx = 0;
        for(int i  = ; i <= ans ; i++)
        printf("%d%c",dp[i]," \n"[i == ans]);
        else
        puts("-1");
    }
    return ;
}