oj.uz

Submission #1089516

# Submission time Handle Problem Language Result Execution time Memory
1089516 2024-09-16T15:45:10 Z ymm Passport (JOI23_passport) C++17
48 / 100
 2000 ms 214796 KB 
#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 {
	vector<set<pii>> vec;
	int n;

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

	optional<int> get(int l1, int r1, int l2, int r2, int i, int b, int e) {
		if (l1 <= b && e <= r1) {
			auto it = vec[i].lower_bound(pii{l2, INT_MIN});
			if (it == vec[i].end() || it->second >= r2)
				return nullopt;
			return it->second;
		}
		if (r1 <= b || e <= l1)
			return nullopt;
		optional<int> ans = nullopt;
		if (!ans) ans = get(l1, r1, l2, r2, 2*i+1, b, (b+e)/2);
		if (!ans) ans = get(l1, r1, l2, r2, 2*i+2, (b+e)/2, e);
		return ans;
	}
	optional<int> get(int l1, int r1, int l2, int r2) { return get(l1, r1, l2, r2, 0, 0, n); }

	void put(int p1, int p2, int x, int i, int b, int e) {
		vec[i].insert({p2, x});
		if (e-b == 1)
			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 remove(int p1, int p2, int x, int i, int b, int e) {
		vec[i].erase({p2, x});
		if (e-b == 1)
			return;
		if (p1 < (b+e)/2)
			remove(p1, p2, x, 2*i+1, b, (b+e)/2);
		else
			remove(p1, p2, x, 2*i+2, (b+e)/2, e);
	}
	void remove(int p1, int p2, int x) { remove(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.get(0, v+1, v, n))) {
			int u = *ou;
			dis[u] = dis[v] + 1;
			vec.push_back(u);
			seg.remove(L[u], R[u], 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.get(0, i+1, i, n))) {
			int j = *oj;
			seg.remove(L[j], R[j], j);
			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
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 2099 ms 214796 KB Time limit exceeded
5 Halted 0 ms 0 KB -

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 464 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 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 1 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 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 2 ms 604 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 464 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 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 1 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 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 18 ms 2356 KB Output is correct
17 Correct 15 ms 2440 KB Output is correct
18 Correct 19 ms 2436 KB Output is correct
19 Correct 15 ms 2448 KB Output is correct
20 Correct 14 ms 2436 KB Output is correct
21 Correct 14 ms 2496 KB Output is correct
22 Correct 11 ms 2488 KB Output is correct
23 Correct 13 ms 2508 KB Output is correct
24 Correct 16 ms 2536 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 464 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 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 1 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 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 18 ms 2356 KB Output is correct
17 Correct 15 ms 2440 KB Output is correct
18 Correct 19 ms 2436 KB Output is correct
19 Correct 15 ms 2448 KB Output is correct
20 Correct 14 ms 2436 KB Output is correct
21 Correct 14 ms 2496 KB Output is correct
22 Correct 11 ms 2488 KB Output is correct
23 Correct 13 ms 2508 KB Output is correct
24 Correct 16 ms 2536 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 18 ms 2356 KB Output is correct
28 Correct 16 ms 2432 KB Output is correct
29 Correct 13 ms 2432 KB Output is correct
30 Correct 13 ms 2436 KB Output is correct
31 Correct 15 ms 2452 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 2099 ms 214796 KB Time limit exceeded
5 Halted 0 ms 0 KB -