Submission #656041

#	Time	Username	Problem	Language	Result	Execution time	Memory
656041		Shahrad	Bitaro’s Party (JOI18_bitaro)	C++17	14 / 100	2074 ms	10984 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;

vector <int> adj[N];
int ans;
int mrk[N], dp[N];

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--;
		adj[u].pb (v);
	}
	while (q--)
	{
		cin >> t >> y;
		for (int i = 0; i < n; i++)
			dp[i] = mrk[i] = 0;
		for (int i = 0; i < y; i++)
		{
			cin >> v;
			v--;
			mrk[v] = 1;
		}
		for (int i = 0; i < t; i++)
		{
			for (int j : adj[i])
				dp[i] = max (dp[i], dp[j] + 1);
			if (dp[i] == 0 && mrk[i])
				dp[i] = -1;
		}
		cout << dp[t - 1] << 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: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 0 / 86