제출 #651385

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

bitaro

#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvt = vt< vt<int> >;

const int N = 1e6 + 5, mod = 1e9 + 7, B = 500;
const ll inf = 1e18 + 7, LIM = (1ll << 60);
const double eps = 1e-6;

int n, m, q, c[N], ans, d[1005][1005];
bool can[N];
vt<int> g[N];

void dfs (int v, int pr, int dist = 0) {
	d[pr][v] = max(d[pr][v], dist);
	for (auto to: g[v]) dfs(to, pr, dist + 1);
}

void solve () {
	cin >> n >> m >> q;
	for (int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].pb(y);
	}             
	for (int i = 1; i <= n; i++) dfs(i, i);
	fill(can, can + n + 1, 1);
	while (q--) {
		int t, y;
		cin >> t >> y;
		for (int i = 1; i <= y; i++) {
			int x;
			cin >> x;
			can[x] = 0;	
		}
		ans = 0;
		for (int i = 1; i <= n; i++) {
			if (can[i]) ans = max(ans, d[i][t]);
		}
		cout << ans << '\n';
		for (int i = 1; i <= n; i++) can[i] = 1;
	}
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

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