제출 #656018

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

bitaro

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
#define endl '\n'
#define pb push_back
#define mk make_pair
#define sz size()
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define kill(x) return cout << x << endl, void();
#define int ll
typedef pair <int, int> pii;
/*
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
*/
const int N = 1e5 + 5;
const int MOD = 998244353, INF = 2e9, MOD2 = 1e9 + 7, sq = 350;

set <int> adj[N];
int ans;
int h[N], mrk[N];

void dfs (int v)
{
	if (!mrk[v])
		ans = max (ans, h[v]);
	for (int u : adj[v])
	{
		if (u >= v)
			continue;
		h[u] = h[v] + 1;
		dfs (u);
	}
}

void Solve ()
{
	int n, m, q, v, u, t, y;
	cin >> n >> m >> q;
	for (int i = 0; i < m; i++)
	{
		cin >> v >> u;
		v--, u--;
		if (v == u)
			continue;
		adj[u].insert (v);
	}
	while (q--)
	{
		cin >> t >> y;
		t--;
		ans = -1;
		h[t] = 0;
		for (int i = 0; i < n; i++)
			mrk[i] = 0;
		for (int i = 0; i < y; i++)
		{
			cin >> v;
			v--;
			mrk[v] = 1;
		}
		dfs (t);
		cout << ans << endl;
	}
}

int32_t main ()
{
	ios::sync_with_stdio (0), cin.tie (0), cout.tie (0);
	int tt = 1;
//	cin >> tt;
	while (tt--)
		Solve ();
}

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