1146 Topological Order (25 分)

1146 Topological Order (25 分)

解题思想

AC代码

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector<vector<int> > g;
vector<int> const_inDegree;
int n, m, k;
int main(){
    scanf("%d%d", &n, &m);
    g.resize(n+1);
    const_inDegree.resize(n+1);
    int a, b;
    for (int i = 0; i < m; i++){
        scanf("%d%d", &a, &b);
        g[a].push_back(b);
        const_inDegree[b]++;
    }
    scanf("%d", &k);
    bool ori = false;
    for (int q = 0; q < k; q++){
        vector<int> inDegree(const_inDegree);
        bool flag = true;
        for (int i = 0; i < n; i++){
            scanf("%d", &a);
            if (inDegree[a] != 0) flag = false;
            for (int v = 0; v < int(g[a].size()); v++)
                inDegree[g[a][v]]--;
        }
        if (flag == false){
            if (ori == true) printf(" ");
            ori = true;
            printf("%d", q);
        }
    }
    return 0;
}