Submission #1031034

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031034		Nonoze	Bitaro’s Party (JOI18_bitaro)	C++17	7 / 100	501 ms	524288 KiB

bitaro

/*
*	Author: Nonoze
*	Created: Monday 22/07/2024
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef _IN_LOCAL
	#define dbg(...)
#endif

#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x, bool write=0, bool write2=1) { if (write && write2) cout << x << endl; else if (write) cout << x << ' '; else cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p, bool write=0, bool write2=1) { read(p.first, write, 0), read(p.second, write, 0); if (write && write2) cout << endl;}
template<typename T> void read(vector<T>& v, bool write=0) { for (auto& x : v) read(x, write, 0); if (write) cout << endl; }
template<typename T1, typename T2> void read(T1& x, T2& y, bool write=0) { read(x, write), read(y, write); if (write) cout << endl; }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z, bool write=0) { read(x, write), read(y, write), read(z, write); if (write) cout << endl; }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz, bool write=0) { read(x, write), read(y, write), read(z, write), read(zz, write); if (write) cout << endl; }
template<typename T> void print(T x) { read(x, 1); }
template<typename T1, typename T2> void print(T1 x, T2 y) { read(x, y, 1); }
template<typename T1, typename T2, typename T3> void print(T1 x, T2 y, T3 z) { read(x, y, z, 1); }
template<typename T1, typename T2, typename T3, typename T4> void print(T1 x, T2 y, T3 z, T4 zz) { read(x, y, z, zz, 1); }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)

#define int long long
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=25;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, k, m, q;
vector<vector<int>> adj;
vector<vector<pair<vector<int>, int>>> queries;
vector<int> ans;
vector<bool> vis;
vector<vector<int>> memo;

int calc(vector<int> &busy, vector<int>& s) {
	// dbg(busy, s);
	unordered_set<int> busy2;
	for (auto u: busy) busy2.insert(u);
	int maxi=-1;
	for (int i=0; i<n; i++) {
		if (busy2.count(i)) continue;
		cmax(maxi, s[i]);
	}
	return maxi;
}

vector<int> dp(int u) {
	if (vis[u]) return memo[u];
	vis[u]=1;
	for (int i=0; i<n; i++) memo[u].pb(-inf);
	memo[u][u]=0;
	for (auto v: adj[u]) {
		auto temp=dp(v);
		for (int i=0; i<n; i++) cmax(memo[u][i], temp[i]+1);
	}
	for (auto x: queries[u]) ans[x.se]=calc(x.fi, memo[u]);
	return memo[u];
}


void solve() {
	read(n, m, q);
	queries.resize(n), ans.resize(q), adj.resize(n), vis.resize(n), memo.resize(n);
	for (int i=0; i<m; i++) {
		int u, v; cin >> u >> v; u--, v--;
		adj[v].push_back(u);
	}
	for (int i=0; i<q; i++) {
		int x, y; cin >> x >> y; x--;
		vector<int> a(y);
		for (int j=0; j<y; j++) cin >> a[j], a[j]--;
		queries[x].push_back({a, i});
	}
	for (int i=n-1; i>=0; i--) if (!vis[i]) dp(i);
	for (auto u: ans) cout << u << endl;
}

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