Submission #656073

#	Time	Username	Problem	Language	Result	Execution time	Memory
656073		Farbod	Bitaro’s Party (JOI18_bitaro)	C++17	14 / 100	68 ms	6400 KiB

bitaro

/*
*  In the name of God
*
*  Author: Farbod Doost
*  Last Modified: Sun, 06 Nov 2022 (12:53:00)
*
*/
#include <iostream>
#include <vector>
using namespace std;

const int N = 1e5 + 1;

int n, m, dp[N];
bool vis[N];
vector <int> adj[N];

signed main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    int q;
	cin >> n >> m >> q;

	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v, u--, v--;

		adj[u].push_back(v);
	}

	int r;
	while (q--) {
		int k, c;
		cin >> r >> k, r--;

		for (int i = 0; i < k; i++)
			cin >> c, vis[c - 1] = 1;
	}

	dp[r] = 0;
	for (int i = r - 1; i >= 0; i--) {
		dp[i] = -1;
		for (auto x: adj[i])
			if (x <= r & dp[x] != -1)
				dp[i] = max(dp[i], dp[x] + 1);
	}

	int ans = -1;
	for (int i = 0; i <= r; i++)
		if (!vis[i])
			ans = max(ans, dp[i]);

	cout << ans;

    return 0;
}

Compilation message (stderr)

bitaro.cpp: In function 'int main()':
bitaro.cpp:45:10: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   45 |    if (x <= r & dp[x] != -1)
      |        ~~^~~~

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