제출 #499146

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499146		pavement	Bitaro’s Party (JOI18_bitaro)	C++17	100 / 100	1944 ms	98196 KiB

bitaro

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
//#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int B = 100;
int N, M, Q, ans, dp[100005];
bool cannot[100005];
vector<int> tmp, adj[100005], radj[100005];
set<int> seen;
ii fr[100005][105];
priority_queue<tuple<ii, int, int> > pq;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M >> Q;
	for (int i = 1, S, E; i <= M; i++) {
		cin >> S >> E;
		adj[E].pb(S);
		radj[S].pb(E);
	}
	for (int i = 1, idx; i <= N; i++) {
		while (!pq.empty()) pq.pop();
		for (int j : adj[i])
			pq.emplace(fr[j][1], j, 1);
		pq.emplace(mp(0, i), -1, -1);
		idx = 1;
		seen.clear();
		while (!pq.empty() && idx <= B) {
			auto [a, b, c] = pq.top();
			pq.pop();
			if (seen.find(a.second) == seen.end()) {
				a.first++;
				fr[i][idx] = a;
				idx++;
				seen.insert(a.second);
			}
			if (b != -1 && fr[b][c + 1].second) {
				c++;
				pq.emplace(fr[b][c], b, c);
			}
		}
	}
	for (int i = 1, T, Y; i <= Q; i++) {
		cin >> T >> Y;
		for (int j = 1, x; j <= Y; j++) {
			cin >> x;
			tmp.pb(x);
			cannot[x] = 1;
		}
		ans = 0;
		if (Y < B) {
			for (int j = 1; j <= B; j++)
				if (!cannot[fr[T][j].second]) {
					ans = fr[T][j].first;
					break;
				}
		} else {
			for (int j = T; j >= 1; j--) {
				dp[j] = (j == T ? 0 : -1e9);
				for (int k : radj[j])
					if (k <= T) dp[j] = max(dp[j], dp[k]);
				dp[j]++;
				if (!cannot[j]) ans = max(ans, dp[j]);
			}
		}
		cout << ans - 1 << '\n';
		for (int j : tmp) cannot[j] = 0;
		tmp.clear();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

bitaro.cpp:38:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   38 | main() {
      | ^~~~

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