답안 #868733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
868733	2023-11-01T19:40:57 Z	NK_	Passport (JOI23_passport)	C++17	100 / 100	346 ms	48020 KB

passport

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back
#define pf push_front
 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;
 
using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;
 
using db = long double;
 
template<class T> using pq = priority_queue<T, V<T>, greater<T>>;
 
const int MOD = 1e9 + 7;
const ll INFL = ll(1e17);
const int LG = 18;

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int N; cin >> N;

	int M = 1; while(M < N) M *= 2;

	V<vi> adj(2*M);
	auto add = [&](int l, int r, int i) {
		for(l += M, r += M+1; l < r; l /= 2, r /= 2) {
			if (l & 1) adj[l++].pb(i);
			if (r & 1) adj[--r].pb(i);
		}
	};

	for(int i = 0; i < N; i++) {
		int l, r; cin >> l >> r; --l, --r;
		add(l, r, i);
	}


	auto comp = [&](vi D) {
		vi vis(N), used(2*M);
		// cerr << "START" << endl;
		pq<pi> q;
		for(int i = 0; i < N; i++) if (D[i] != MOD) {
			q.push(mp(D[i], i));
		}

		while(sz(q)) {
			auto [d, x] = q.top(); q.pop();

			if (vis[x]) continue;
			vis[x] = 1;

			// cerr << x << " " << d << endl;

			int u = x + M;
			while(u > 0 && !used[u]) {
				used[u] = 1;
				for(auto& v : adj[u]) {
					if ((d + 1) < D[v]) {
						D[v] = d + 1;
						q.push(mp(D[v], v));
					}
				}
				u /= 2;
			}
		}

		// cerr << "END" << endl;
		return D;
	};

	vi L(N, MOD); L[0] = 0; L = comp(L);
	vi R(N, MOD); R[N-1] = 0; R = comp(R);


	vi ans(N); for(int i = 0; i < N; i++) {
		ans[i] = L[i] + R[i] - (i != 0 && i != N-1);
		// cerr << L[i] << " " << R[i] << " => " << ans[i] << endl;
	}
	ans = comp(ans);

	int Q; cin >> Q;
	for(int i = 0; i < Q; i++) {
		int x; cin >> x; --x;
		cout << (ans[x] >= MOD ? -1 : ans[x]) << nl;
	}

	exit(0-0);
}

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	312 ms	44564 KB	Output is correct
5	Correct	135 ms	35124 KB	Output is correct
6	Correct	73 ms	34192 KB	Output is correct
7	Correct	96 ms	32212 KB	Output is correct
8	Correct	46 ms	29624 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct

Subtask #3
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	2 ms	860 KB	Output is correct
17	Correct	2 ms	856 KB	Output is correct
18	Correct	2 ms	856 KB	Output is correct
19	Correct	2 ms	860 KB	Output is correct
20	Correct	1 ms	860 KB	Output is correct
21	Correct	1 ms	732 KB	Output is correct
22	Correct	1 ms	860 KB	Output is correct
23	Correct	2 ms	860 KB	Output is correct
24	Correct	1 ms	720 KB	Output is correct

Subtask #4
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	2 ms	860 KB	Output is correct
17	Correct	2 ms	856 KB	Output is correct
18	Correct	2 ms	856 KB	Output is correct
19	Correct	2 ms	860 KB	Output is correct
20	Correct	1 ms	860 KB	Output is correct
21	Correct	1 ms	732 KB	Output is correct
22	Correct	1 ms	860 KB	Output is correct
23	Correct	2 ms	860 KB	Output is correct
24	Correct	1 ms	720 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	860 KB	Output is correct
28	Correct	2 ms	860 KB	Output is correct
29	Correct	1 ms	860 KB	Output is correct
30	Correct	2 ms	980 KB	Output is correct
31	Correct	2 ms	860 KB	Output is correct

Subtask #5
46.0 / 46.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	312 ms	44564 KB	Output is correct
5	Correct	135 ms	35124 KB	Output is correct
6	Correct	73 ms	34192 KB	Output is correct
7	Correct	96 ms	32212 KB	Output is correct
8	Correct	46 ms	29624 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	2 ms	860 KB	Output is correct
25	Correct	2 ms	856 KB	Output is correct
26	Correct	2 ms	856 KB	Output is correct
27	Correct	2 ms	860 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	1 ms	732 KB	Output is correct
30	Correct	1 ms	860 KB	Output is correct
31	Correct	2 ms	860 KB	Output is correct
32	Correct	1 ms	720 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	1 ms	860 KB	Output is correct
38	Correct	2 ms	980 KB	Output is correct
39	Correct	2 ms	860 KB	Output is correct
40	Correct	346 ms	48020 KB	Output is correct
41	Correct	167 ms	35624 KB	Output is correct
42	Correct	218 ms	45256 KB	Output is correct
43	Correct	198 ms	45124 KB	Output is correct
44	Correct	97 ms	34428 KB	Output is correct
45	Correct	126 ms	37240 KB	Output is correct
46	Correct	62 ms	15972 KB	Output is correct
47	Correct	163 ms	38428 KB	Output is correct
48	Correct	138 ms	37496 KB	Output is correct

답안 #868733

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 16.0 / 16.0

Subtask #3 24.0 / 24.0

Subtask #4 8.0 / 8.0

Subtask #5 46.0 / 46.0

Subtask #1
6.0 / 6.0

Subtask #2
16.0 / 16.0

Subtask #3
24.0 / 24.0

Subtask #4
8.0 / 8.0

Subtask #5
46.0 / 46.0