Submission #1297633

#	Time	Username	Problem	Language	Result	Execution time	Memory
1297633		thieunguyenhuy	Passport (JOI23_passport)	C++20	6 / 100	205 ms	65472 KiB

passport

#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
	sort (ve.begin(), ve.end());
	ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
	return uniform_int_distribution<long long>(l, r)(rng);
}
unsigned long long random(unsigned long long l, unsigned long long r) {
	return uniform_int_distribution<unsigned long long>(l, r)(rng);
}
template <class T> T random(T r) {
	return rng() % r;
}

const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

int n, q, numNode = 0;
int L[N], R[N], in[N], out[N], dist[5 * N];
vii adj[5 * N];

int build(int l, int r) {
	int id = ++numNode;
	assert(id < 5 * N);
	if (l == r) {
		out[l] = ++numNode;
		return in[l] = id;
	}
	int mid = (l + r) >> 1;
	adj[id].emplace_back(build(l, mid), 0);
	adj[id].emplace_back(build(mid + 1, r), 0);
	return id;
}

void add(int id, int l, int r, int u, int v, int x) {
	if (l > v || r < u) return;
	if (u <= l && r <= v) {
		adj[x].emplace_back(id, 0);
		return;
	}
	int mid = (l + r) >> 1;
	assert(adj[id].size() == 2);
	add(adj[id][0].fi, l, mid, u, v, x);
	add(adj[id][1].fi, mid + 1, r, u, v, x);
}

int solve(int s) {
	for (int j = 1; j <= numNode; ++j) dist[j] = inf;
		
	deque<int> q; q.emplace_back(in[s]); dist[in[s]] = 0;
	while (!q.empty()) {
		int u = q.front(); q.pop_front();
		for (auto [v, w] : adj[u]) if (minimize(dist[v], dist[u] + w)) {
			if (w == 0) q.emplace_front(v);
			else q.emplace_back(v);
		}
	}

	int ans = 0;
	for (int i = 1; i <= n; ++i) maximize(ans, dist[in[i]]);
	return (ans == inf ? -1 : ans);
}

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

	cin >> n;

	build(1, n);

	for (int i = 1; i <= n; ++i) {
		cin >> L[i] >> R[i];
		add(1, 1, n, L[i], R[i], out[i]);
	}

	for (int i = 1; i <= n; ++i) adj[in[i]].emplace_back(out[i], 1);

	cin >> q;
	for (int i = 1; i <= q; ++i) {
		int u; cin >> u;
		cout << solve(u) << '\n';
	}

	return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 8
• Subtask 5: 0 / 46