oj.uz

Submission #883583

# Submission time Handle Problem Language Result Execution time Memory
883583 2023-12-05T12:52:48 Z Mik01aj Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 675 ms 88156 KB 
#include <iostream>
#include <vector>
#include <map>
#include <stack>
#define ll long long
using namespace std;


const int N = 520005, K = 20, inf = 1e9;
int n, k, m, q, min_l[K][N], max_r[K][N], s = 1, treer[N], treel[N];

void updateR(int l, int r, int v) {
	l += s;
	r += s;
	treer[l] = max(treer[l], v);
	treer[r] = max(treer[r], v);
	while (l + 1 < r) {
		if (!(l & 1)) {
			treer[l + 1] = max(treer[l + 1], v);
		}
		if (r & 1) {
			treer[r - 1] = max(treer[r - 1], v);
		}
		r >>= 1;
		l >>= 1;
	}
}
void updateL(int l, int r, int v) {
	l += s;
	r += s;
	treel[l] = min(treel[l], v);
	treel[r] = min(treel[r], v);
	while (l + 1 < r) {
		if (!(l & 1)) {
			treel[l + 1] = min(treel[l + 1], v);
		}
		if (r & 1) {
			treel[r - 1] = min(treel[r - 1], v);
		}
		r >>= 1;
		l >>= 1;
	}
}
int findR(int l, int r, int bit) {
	l += s;
	r += s;
	int maxi = max(max_r[bit][l], max_r[bit][r]);
	while (l + 1 < r) {
		if (!(l & 1)) {
			maxi = max(maxi, max_r[bit][l + 1]);
		}
		if (r & 1) {
			maxi = max(maxi, max_r[bit][r - 1]);
		}
		r >>= 1;
		l >>= 1;
	}
	return maxi;
}
int findL(int l, int r, int bit) {
	l += s;
	r += s;
	int mini = min(min_l[bit][l], min_l[bit][r]);
	while (l + 1 < r) {
		if (!(l & 1)) {
			mini = min(mini, min_l[bit][l + 1]);
		}
		if (r & 1) {
			mini = min(mini, min_l[bit][r - 1]);
		}
		r >>= 1;
		l >>= 1;
	}
	return mini;
}
int fl(int i) {
	i += s;
	int mini = inf;
	while (i > 0) {
		mini = min(mini, treel[i]);
		i >>= 1;
	}
	return mini;
}
int fr(int i) {
	i += s;
	int maxi = 0;
	while (i > 0) {
		maxi = max(maxi, treer[i]);
		i >>= 1;
	}
	return maxi;
}

int main()
{
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(0);
	cin >> n >> k >> m;
	while (s <= n)
		s <<= 1;
	for (int i = 0; i <= 2 * s; i++) {
		treel[i] = inf;
		treer[i] = 0;
	}
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		if (a < b) {
			updateR(a, min(a + k - 1, b), b);
		}
		else
		{
			updateL(max(b, a - k + 1), a, b);
		}
	}
	for (int i = 0; i <= n; i++) {
		min_l[0][i + s] = min(i, fl(i));
		max_r[0][i + s] = max(i, fr(i));
	}
	for (int i = s - 1; i > 0; i--) {
		min_l[0][i] = min(min_l[0][2 * i], min_l[0][2 * i + 1]);
		max_r[0][i] = max(max_r[0][2 * i], max_r[0][2 * i + 1]);
	}
	for (int j = 1; j < K; j++) {
		for (int i = 1; i < 2 * s; i++) {
			min_l[j][i] = findL(min_l[j - 1][i], max_r[j - 1][i], j - 1);
			max_r[j][i] = findR(min_l[j - 1][i], max_r[j - 1][i], j - 1);
		}
	}
	cin >> q;
	for (; q--;) {
		int a, b;
		cin >> a >> b;
		int l = a, r = a, res = 0;
		bool ok = 0;
		for (int i = K - 1; i >= 0; i--) {
			int new_l = findL(l, r, i), new_r = findR(l, r, i);
			if (new_l <= b && new_r >= b)
				ok = 1;
			else {
				res += (1 << i);
				l = new_l;
				r = new_r;
			}
		}
		if (ok)
			cout << res + 1 << '\n';
		else
			cout << -1 << '\n';
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 84568 KB Output is correct
2 Correct 9 ms 84440 KB Output is correct
3 Correct 9 ms 84604 KB Output is correct
4 Correct 9 ms 84572 KB Output is correct
5 Correct 9 ms 84572 KB Output is correct
6 Correct 9 ms 84452 KB Output is correct
7 Correct 10 ms 84572 KB Output is correct
8 Correct 9 ms 84572 KB Output is correct
9 Correct 9 ms 84572 KB Output is correct
10 Correct 8 ms 84572 KB Output is correct
11 Correct 8 ms 84568 KB Output is correct
12 Correct 9 ms 84572 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 84568 KB Output is correct
2 Correct 9 ms 84440 KB Output is correct
3 Correct 9 ms 84604 KB Output is correct
4 Correct 9 ms 84572 KB Output is correct
5 Correct 9 ms 84572 KB Output is correct
6 Correct 9 ms 84452 KB Output is correct
7 Correct 10 ms 84572 KB Output is correct
8 Correct 9 ms 84572 KB Output is correct
9 Correct 9 ms 84572 KB Output is correct
10 Correct 8 ms 84572 KB Output is correct
11 Correct 8 ms 84568 KB Output is correct
12 Correct 9 ms 84572 KB Output is correct
13 Correct 16 ms 84572 KB Output is correct
14 Correct 15 ms 84572 KB Output is correct
15 Correct 13 ms 84572 KB Output is correct
16 Correct 13 ms 84568 KB Output is correct
17 Correct 12 ms 84568 KB Output is correct
18 Correct 11 ms 84572 KB Output is correct
19 Correct 12 ms 84648 KB Output is correct
20 Correct 11 ms 84572 KB Output is correct
21 Correct 12 ms 84572 KB Output is correct
22 Correct 11 ms 84516 KB Output is correct
23 Correct 14 ms 84572 KB Output is correct
24 Correct 13 ms 84572 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 407 ms 85876 KB Output is correct
2 Correct 421 ms 85796 KB Output is correct
3 Correct 471 ms 85864 KB Output is correct
4 Correct 389 ms 85812 KB Output is correct
5 Correct 240 ms 87120 KB Output is correct
6 Correct 275 ms 86976 KB Output is correct
7 Correct 241 ms 87124 KB Output is correct
8 Correct 215 ms 85844 KB Output is correct
9 Correct 225 ms 85844 KB Output is correct
10 Correct 284 ms 87024 KB Output is correct
11 Correct 320 ms 87180 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 86564 KB Output is correct
2 Correct 308 ms 87892 KB Output is correct
3 Correct 376 ms 86768 KB Output is correct
4 Correct 257 ms 87376 KB Output is correct
5 Correct 272 ms 87972 KB Output is correct
6 Correct 260 ms 87768 KB Output is correct
7 Correct 352 ms 87852 KB Output is correct
8 Correct 412 ms 87724 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 675 ms 88152 KB Output is correct
2 Correct 499 ms 87096 KB Output is correct
3 Correct 497 ms 86492 KB Output is correct
4 Correct 545 ms 86124 KB Output is correct
5 Correct 306 ms 85608 KB Output is correct
6 Correct 602 ms 85544 KB Output is correct
7 Correct 563 ms 86532 KB Output is correct
8 Correct 9 ms 84496 KB Output is correct
9 Correct 17 ms 84592 KB Output is correct
10 Correct 565 ms 87212 KB Output is correct
11 Correct 596 ms 87892 KB Output is correct
12 Correct 586 ms 87632 KB Output is correct
13 Correct 587 ms 87632 KB Output is correct
14 Correct 10 ms 84524 KB Output is correct
15 Correct 17 ms 84652 KB Output is correct
16 Correct 443 ms 87120 KB Output is correct
17 Correct 633 ms 87900 KB Output is correct
18 Correct 629 ms 88120 KB Output is correct
19 Correct 600 ms 87900 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 84568 KB Output is correct
2 Correct 9 ms 84440 KB Output is correct
3 Correct 9 ms 84604 KB Output is correct
4 Correct 9 ms 84572 KB Output is correct
5 Correct 9 ms 84572 KB Output is correct
6 Correct 9 ms 84452 KB Output is correct
7 Correct 10 ms 84572 KB Output is correct
8 Correct 9 ms 84572 KB Output is correct
9 Correct 9 ms 84572 KB Output is correct
10 Correct 8 ms 84572 KB Output is correct
11 Correct 8 ms 84568 KB Output is correct
12 Correct 9 ms 84572 KB Output is correct
13 Correct 16 ms 84572 KB Output is correct
14 Correct 15 ms 84572 KB Output is correct
15 Correct 13 ms 84572 KB Output is correct
16 Correct 13 ms 84568 KB Output is correct
17 Correct 12 ms 84568 KB Output is correct
18 Correct 11 ms 84572 KB Output is correct
19 Correct 12 ms 84648 KB Output is correct
20 Correct 11 ms 84572 KB Output is correct
21 Correct 12 ms 84572 KB Output is correct
22 Correct 11 ms 84516 KB Output is correct
23 Correct 14 ms 84572 KB Output is correct
24 Correct 13 ms 84572 KB Output is correct
25 Correct 407 ms 85876 KB Output is correct
26 Correct 421 ms 85796 KB Output is correct
27 Correct 471 ms 85864 KB Output is correct
28 Correct 389 ms 85812 KB Output is correct
29 Correct 240 ms 87120 KB Output is correct
30 Correct 275 ms 86976 KB Output is correct
31 Correct 241 ms 87124 KB Output is correct
32 Correct 215 ms 85844 KB Output is correct
33 Correct 225 ms 85844 KB Output is correct
34 Correct 284 ms 87024 KB Output is correct
35 Correct 320 ms 87180 KB Output is correct
36 Correct 371 ms 86564 KB Output is correct
37 Correct 308 ms 87892 KB Output is correct
38 Correct 376 ms 86768 KB Output is correct
39 Correct 257 ms 87376 KB Output is correct
40 Correct 272 ms 87972 KB Output is correct
41 Correct 260 ms 87768 KB Output is correct
42 Correct 352 ms 87852 KB Output is correct
43 Correct 412 ms 87724 KB Output is correct
44 Correct 675 ms 88152 KB Output is correct
45 Correct 499 ms 87096 KB Output is correct
46 Correct 497 ms 86492 KB Output is correct
47 Correct 545 ms 86124 KB Output is correct
48 Correct 306 ms 85608 KB Output is correct
49 Correct 602 ms 85544 KB Output is correct
50 Correct 563 ms 86532 KB Output is correct
51 Correct 9 ms 84496 KB Output is correct
52 Correct 17 ms 84592 KB Output is correct
53 Correct 565 ms 87212 KB Output is correct
54 Correct 596 ms 87892 KB Output is correct
55 Correct 586 ms 87632 KB Output is correct
56 Correct 587 ms 87632 KB Output is correct
57 Correct 10 ms 84524 KB Output is correct
58 Correct 17 ms 84652 KB Output is correct
59 Correct 443 ms 87120 KB Output is correct
60 Correct 633 ms 87900 KB Output is correct
61 Correct 629 ms 88120 KB Output is correct
62 Correct 600 ms 87900 KB Output is correct
63 Correct 532 ms 86400 KB Output is correct
64 Correct 604 ms 86864 KB Output is correct
65 Correct 553 ms 86868 KB Output is correct
66 Correct 303 ms 87892 KB Output is correct
67 Correct 473 ms 88148 KB Output is correct
68 Correct 261 ms 87768 KB Output is correct
69 Correct 261 ms 87660 KB Output is correct
70 Correct 380 ms 87892 KB Output is correct
71 Correct 426 ms 88156 KB Output is correct