题意:
给定有向无环图,然后给出序列问 哪些不符合拓扑序
思路:
开始有点忘了拓扑序了,后面知道:
符合拓扑序的情况为:任意u,v属于有向无环图,且u能到达v的两个点,,在序列中u必须在v前面
所以不符合拓扑序的序列中,一定有一个点在其前驱结点的前面;跑一边图就知道这样的点是否存在了
#include<bits/stdc++.h>
#include<cstring>
#define FI first
#define SE second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int maxn = 1000 + 7;
const int maxd = 2e4 + 77;
const ll INF = 0x7f7f7f7f;
int n, m, q;
vector<int> vec[maxn];
vector<int> ans;
int id[maxn];
void solve(int pos) {
int u, v;
bool ok = true;
for(int i = 1; i <= n; ++i) {
scanf("%d", &v);
id[v] = i;
}
for(int i = 1; i <= n; ++i) {
for(auto j : vec[i]) {
if(id[i] > id[j]) {
ok = false;
break;
}
}
if(!ok) break;
}
if(!ok) ans.push_back(pos);
}
int main() {
scanf("%d%d", &n, &m);
int u, v;
for(int i = 1; i <= m; ++i) {
scanf("%d%d", &u, &v);
vec[u].push_back(v);
}
scanf("%d", &q);
for(int i = 0; i < q; ++i) {
solve(i);
}
for(int i = 0; i < ans.size(); ++i) {
if(i) printf(" ");
printf("%d", ans[i]);
}
return 0;
}