제출 #383398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
383398		morato	Bitaro’s Party (JOI18_bitaro)	C++17	0 / 100	4 ms	2924 KiB

bitaro

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 5;

vector<int> adj[MAXN];

int mark[MAXN], ans[MAXN], in[MAXN];
int a[2 * MAXN], b[2 * MAXN];
bool valid[MAXN];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m, q;
	cin >> n >> m >> q;
	for (int i = 0; i < m; i++) {
		cin >> a[i] >> b[i];
	}
	int t, y;
	cin >> t >> y;
	valid[t] = true;
	for (int i = 0; i < m; i++) {
		adj[b[i]].push_back(a[i]);
		in[a[i]]++;
	}
	for (int i = 0; i < y; i++) {
		int x;
		cin >> x;
		mark[x] = 1;
	}
	vector<int> lista;
	for (int i = 1; i <= n; i++) {
		if (!in[i]) {
			lista.push_back(i);
		}
	}
	for (int i = 0; i < (int) lista.size(); i++) {
		int cur = lista[i];
		for (int nxt : adj[cur]) {
			if (valid[cur]) {
				valid[nxt] = true;
				ans[nxt] = max(ans[nxt], ans[cur] + 1);
			}
			in[nxt]--;
			if (!in[nxt]) lista.push_back(nxt);
		}
	}
	int resp = -1;
	for (int i = 1; i <= t; i++) {
		if (!mark[i]) resp = max(resp, ans[i]);
	}
	cout << resp << '\n';
	return 0; 
}

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