hdoj-1285-确定比赛名次（拓扑排序）

题目链接

 /*
     Name:hdoj-1285-确定比赛名次
     Copyright:
     Author:
     Date: 2018/4/11 15:59:18
     Description:
         标准的拓扑排序模板题，注意要优先小号输出
 */
 #include <iostream>
 #include <queue>
 #include <vector>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 const int MAXN = 1e+;
 int du[MAXN], n , m, L[MAXN];
 vector<int>  g[MAXN];
 int topsort() {
     memset(du, , sizeof(du));
     for (int i=; i<n; i++) {
         for (int j=; j<g[i].size(); j++) {
             du[g[i][j]]++;
         }
     }
     int tot = ;
     priority_queue<int, vector<int>, greater<int>> Q;
     for (int i=; i<n; i++) {
         if (!du[i]) {
             Q.push(i);
         }
     }
     while (!Q.empty()) {
         int x = Q.top();
         Q.pop();
         L[tot++] = x;
         for (int j=; j<g[x].size(); j++) {
             int t = g[x][j];
             du[t]--;
             if (!du[t]) {
                 Q.push(t);
             }
         }
     }
     if (tot == n) return ;
     return ;
 }
 int main()
 {
 //    freopen("in.txt", "r", stdin);
     while (cin>>n>>m) {
         memset(L, , sizeof(L));
         memset(g, , sizeof(g));
         for (int i=; i<m; i++) {
             int a, b;
             cin>>a>>b;
             a--;
             b--;
             if (find(g[a].begin(), g[a].end(), b) != g[a].end()) continue;
             g[a].push_back(b);
         }
         if (topsort() == ) {
             cout<<L[]+ ;
             for (int i=; i<n; i++) {
                 cout<<" "<<L[i]+;
             }
         }
         cout<<endl;
     }
     return ;
 }