提出 #70523725

---

ソースコード 拡げる

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, m; cin >> n >> m;
		vector to(n, vector<int>());
		rep(i, m) {
			int u, v; cin >> u >> v;
			u--, v--;
			to[u].push_back(v);
		}
		vector<int>p(n), q(n);
		rep(i, n) {
			cin >> p[i], p[i]--;
			q[p[i]] = i;
		}

		vector<int>deg(n);
		int ans = n;
		rep(i, n)for (auto j : to[i])deg[j]++;
		for (int i = 0; i < n;) {
			int j = i + 1;
			while (j < n && deg[q[j]] == 0)j++;
			rep2(k, i, j)for (auto l : to[q[k]])deg[l]--;
			i = j;
			ans--;
		}
		cout << ans << endl;
	}
	return 0;
}

提出情報

ジャッジ結果