1146 Topological Order (25分)

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int SIZE = 100005;
vector<int> adj[SIZE];
int degreeIn[SIZE];
int temp[SIZE];
int main() {
	int N, M;
	cin >> N >> M;
	int u, v;
	for (int i = 0; i < M; i++) {
		cin >> u >> v;
		adj[u].push_back(v);
		degreeIn[v] ++;
	}
	int K, tempU;
	cin >> K;
	vector<int> res;
	for (int i = 0; i < K; i++) {
		for (int j = 0; j < SIZE; j++) {
			temp[j] = degreeIn[j];
		}
		bool flag = true;
		for (int k = 0; k < N; k++) {
			cin >> tempU;
			if (temp[tempU] > 0) {
				flag = false;
			}
			for (int j = 0; j < adj[tempU].size(); j++) temp[adj[tempU][j]] --;
		}
		if (!flag)	res.push_back(i);
	}
	for (int i = 0; i < res.size(); i++) {
		if (i != res.size() - 1) cout << res[i] << " ";
		else cout << res[i] << endl;
	}
	return 0;
}