Submission #1089543

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1089543	2024-09-16T16:08:23 Z	ymm	Passport (JOI23_passport)	C++17	100 / 100	616 ms	38860 KB

passport

#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 400'010;

int L[N], R[N];
int to_l[N], to_r[N];
int n, q;
int constexpr inf = 1e9;

struct Seg2 {
	struct Node : public vector<pii> {
		int mx = -1;
	};
	vector<Node> vec;
	bool made = 0;
	int n;

	Seg2(int n) : vec(4*n), n(n) {}

	void upleaf(int i) { vec[i].mx = vec[i].size()? vec[i].back().first: -1; }
	void upint(int i) { vec[i].mx = max(vec[2*i+1].mx, vec[2*i+2].mx); }

	optional<int> pop(int l1, int r1, int l2, int i, int b, int e) {
		if (r1 <= b || e <= l1 || vec[i].mx < l2)
			return nullopt;
		if (e - b == 1) {
			auto ans = vec[i].back().second;
			vec[i].pop_back();
			upleaf(i);
			return ans;
		}
		optional<int> ans = nullopt;
		if (!ans) ans = pop(l1, r1, l2, 2*i+1, b, (b+e)/2);
		if (!ans) ans = pop(l1, r1, l2, 2*i+2, (b+e)/2, e);
		upint(i);
		return ans;
	}
	optional<int> pop(int l1, int r1, int l2) { if (!made) make(); return pop(l1, r1, l2, 0, 0, n); }

	void make(int i, int b, int e) {
		if (e - b == 1) {
			sort(vec[i].begin(), vec[i].end());
			upleaf(i);
			return;
		}
		make(2*i+1, b, (b+e)/2);
		make(2*i+2, (b+e)/2, e);
		upint(i);
	}
	void make() { make(0, 0, n); made = 1; }

	void put(int p1, int p2, int x, int i, int b, int e) {
		if (e-b == 1) {
			vec[i].emplace_back(p2, x);
			return;
		}
		if (p1 < (b+e)/2)
			put(p1, p2, x, 2*i+1, b, (b+e)/2);
		else
			put(p1, p2, x, 2*i+2, (b+e)/2, e);
	}
	void put(int p1, int p2, int x) { put(p1, p2, x, 0, 0, n); }
};

void single_bfs(int s, int dis[])
{
	fill(dis, dis+n, inf);
	dis[s] = 0;
	vector<int> vec = {s};
	Seg2 seg(n);
	Loop (i,0,n) {
		if (i != s)
			seg.put(L[i], R[i], i);
	}
	Loop (i,0,vec.size()) {
		int v = vec[i];
		optional<int> ou;
		while ((ou = seg.pop(0, v+1, v))) {
			int u = *ou;
			dis[u] = dis[v] + 1;
			vec.push_back(u);
		}
	}
}

int dis[N];

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n;
	Loop (i,0,n) {
		cin >> L[i] >> R[i];
		--L[i]; --R[i];
	}
	single_bfs(0, to_l);
	single_bfs(n-1, to_r);
	priority_queue<pii, vector<pii>, greater<pii>> pq;
	Seg2 seg(n);
	Loop (i,0,n) {
		dis[i] = to_l[i] + to_r[i] - (i != 0 && i != n-1);
		pq.emplace(dis[i], i);
		seg.put(L[i], R[i], i);
	}
	while (pq.size()) {
		auto [d, i] = pq.top();
		pq.pop();
		if (d != dis[i])
			continue;
		optional<int> oj;
		while ((oj = seg.pop(0, i+1, i))) {
			int j = *oj;
			if (dis[j] <= d + 1)
				continue;
			//cerr << i << " updates " << j << " to " << d + 1 << '\n';
			dis[j] = d + 1;
			pq.emplace(dis[j], j);
		}
	}
	cin >> q;
	while (q--) {
		int x;
		cin >> x;
		cout << (dis[x-1] >= inf? -1: dis[x-1]) << '\n';
	}
}

Subtask #1
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	598 ms	35516 KB	Output is correct
5	Correct	515 ms	35052 KB	Output is correct
6	Correct	468 ms	37472 KB	Output is correct
7	Correct	226 ms	33628 KB	Output is correct
8	Correct	154 ms	27316 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct

Subtask #3
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	5 ms	860 KB	Output is correct
17	Correct	5 ms	840 KB	Output is correct
18	Correct	4 ms	860 KB	Output is correct
19	Correct	4 ms	860 KB	Output is correct
20	Correct	4 ms	860 KB	Output is correct
21	Correct	3 ms	860 KB	Output is correct
22	Correct	2 ms	860 KB	Output is correct
23	Correct	4 ms	860 KB	Output is correct
24	Correct	3 ms	860 KB	Output is correct

Subtask #4
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	5 ms	860 KB	Output is correct
17	Correct	5 ms	840 KB	Output is correct
18	Correct	4 ms	860 KB	Output is correct
19	Correct	4 ms	860 KB	Output is correct
20	Correct	4 ms	860 KB	Output is correct
21	Correct	3 ms	860 KB	Output is correct
22	Correct	2 ms	860 KB	Output is correct
23	Correct	4 ms	860 KB	Output is correct
24	Correct	3 ms	860 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	5 ms	860 KB	Output is correct
28	Correct	5 ms	860 KB	Output is correct
29	Correct	4 ms	1004 KB	Output is correct
30	Correct	4 ms	860 KB	Output is correct
31	Correct	4 ms	860 KB	Output is correct

Subtask #5
46.0 / 46.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	598 ms	35516 KB	Output is correct
5	Correct	515 ms	35052 KB	Output is correct
6	Correct	468 ms	37472 KB	Output is correct
7	Correct	226 ms	33628 KB	Output is correct
8	Correct	154 ms	27316 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 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	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	5 ms	860 KB	Output is correct
25	Correct	5 ms	840 KB	Output is correct
26	Correct	4 ms	860 KB	Output is correct
27	Correct	4 ms	860 KB	Output is correct
28	Correct	4 ms	860 KB	Output is correct
29	Correct	3 ms	860 KB	Output is correct
30	Correct	2 ms	860 KB	Output is correct
31	Correct	4 ms	860 KB	Output is correct
32	Correct	3 ms	860 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	5 ms	860 KB	Output is correct
36	Correct	5 ms	860 KB	Output is correct
37	Correct	4 ms	1004 KB	Output is correct
38	Correct	4 ms	860 KB	Output is correct
39	Correct	4 ms	860 KB	Output is correct
40	Correct	616 ms	38408 KB	Output is correct
41	Correct	540 ms	36588 KB	Output is correct
42	Correct	448 ms	36580 KB	Output is correct
43	Correct	415 ms	36564 KB	Output is correct
44	Correct	471 ms	38860 KB	Output is correct
45	Correct	405 ms	37516 KB	Output is correct
46	Correct	164 ms	13792 KB	Output is correct
47	Correct	397 ms	35680 KB	Output is correct
48	Correct	329 ms	36168 KB	Output is correct

Submission #1089543

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