P1983 车站分级 (拓扑排序

#include <bits/stdc++.h>
#define int_max 0x3f3f3f3f;
#define long_max 9223372036854775807;
using namespace std;
using VI = vector<int>;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef unsigned long long ull;
const int MAXN = 1e6;
int n,m;
int in[1010];
vector<int> g[1010];
int pd[1010][1010];
int st[1010];
int main() {
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int s;
        cin>>s;
        VI a;
        memset(st,0,sizeof st);
        for(int j=1;j<=s;j++){
            int x;
            cin>>x;
            a.push_back(x);
            st[x] = 1;
        }

        for(int j=a[0];j<=a[s-1];j++){
            if(st[j]) continue;
            for(int k=0;k<s;k++){
                if(!pd[j][a[k]]){
                    in[a[k]]++;
                    g[j].push_back(a[k]);
                    pd[j][a[k]] = 1;
                }
            }
        }
    }
    queue<pair<int,int>>q;
    for(int i=1;i<=n;i++){
        //<<in[i]<<" ";
        if(in[i] == 0) q.push({i,1});
    }
    int res = 1;
    while(q.size()){
        auto x = q.front();
        q.pop();
        int now = x.first;
        int level = x.second;
        for(int i=0;i<g[now].size();i++){
            int to = g[now][i];
            in[to] --;
            if(in[to] == 0){
                q.push({to,level + 1});
                res = max(res,level + 1);
            }
        }
    }
    cout<<res;
//1 2 3 4 5 6 7 8 9
//2 0 2 0 2 2 0 0 0
//2 0 3 0 3 3 0 0 0
//8 0 3 0 0 9 0 0 6
}

通过pd数组来防止建重边，减少循环次数