Submission #1031033

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031033		belgianbot	Bitaro’s Party (JOI18_bitaro)	C++17	0 / 100	3 ms	4444 KiB

bitaro

#include <bits/stdc++.h>

using namespace std;

int N, M, Q;
vector<vector<int>> adj;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> N >> M >> Q;
	adj.resize(N);
	
	for (int i = 0; i < M; i++) {
		int a, b; cin >> a >> b; a--; b--;
		adj[b].push_back(a);
	}
	
	vector<vector<int>> sol(N, vector<int>(N, -1));
	for (int i = 0; i < N; i++) {
		sol[i][i] = 0;
		for (int j : adj[i]) {
			sol[i][j] = 1;
			for (int k = 0; k < i; k++) {
				sol[i][k] = max(sol[i][k], sol[j][k] + 1);
			}
		}
	}
	
	while (Q--) {
		int T, Y; cin >> T >> Y; T--;
		vector<bool> busy(N, false);
		for (int i = 0; i < Y; i++) {
			int a; cin >> a; a--;
			busy[a] = true;
		}
		int ans = -1;
		for (int i = 0; i <= T; i++) {
			if (!busy[i]) {
				ans = max(ans, sol[T][i]);
			}
		}
		cout << ans << '\n';
	} 
			
	
	return 0;
}
			

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86