제출 #1030935

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1030935		belgianbot	Bitaro’s Party (JOI18_bitaro)	C++17	7 / 100	2065 ms	314316 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<set<pair<int,int>>> sol(N);
	for (int i = 0; i < N; i++) {
		vector<int> processed(N, INT_MAX);
		sol[i].insert({0,i});
		for (int j : adj[i]) {
			if (processed[j] != INT_MAX) continue; 
			sol[i].insert({-1,j});
			for (auto x : sol[j]) {
				if (processed[x.second] < x.first) continue;
				processed[x.second] = x.first - 1;
				sol[i].insert({x.first - 1, x.second});
			}
		}
	}
	
	while (Q--) {
		int T, Y; cin >> T >> Y; T--;
		vector<int> busy(Y);
		for (int i = 0; i < Y; i++) {
			cin >> busy[i];
			busy[i]--;
		}
		bool ok = false;
		for (auto i : sol[T]) {
			auto it = lower_bound(busy.begin(), busy.end(), i.second);
			if (it == busy.end() || (*it) != i.second) {
				ok = true;
				cout << -i.first << '\n';
				break;
			}
		}
		if (!ok) cout << -1 << '\n';
	}
	
	return 0;
}
			

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