oj.uz

Submission #849760

# Submission time Handle Problem Language Result Execution time Memory
849760 2023-09-15T09:26:30 Z qthang2k11 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 1302 ms 129100 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5, lg = __lg(N) + 1;

int n, k, m, q;

struct Node {
	int l, r;
	
	Node(int l = N, int r = 0):
		l(l), r(r) {}
	
	Node operator + (const Node &other) const {
		return Node(min(l, other.l), max(r, other.r));
	}
	
	Node& operator += (const Node &other) {
		l = min(l, other.l);
		r = max(r, other.r);
		return (*this);
	}
};

struct SegmentTree {
	Node IT[N << 2], LZ[N << 2];
	
	SegmentTree() = default;
	
	void apply(int id, const Node &val) {
		IT[id] += val;
		LZ[id] += val;
	}
	
	void push(int id) {
		Node &cur = LZ[id];
		if (cur.l == N && cur.r == 0) return;
		apply(id << 1, cur);
		apply(id << 1 | 1, cur);
		cur = Node();
	}
	
	void update(int x, int y, const Node &val, int id, int l, int r) {
		if (l > y || r < x) return;
		if (x <= l && r <= y) 
			return apply(id, val);
		push(id);
		int mid = (l + r) / 2;
		update(x, y, val, id << 1, l, mid);
		update(x, y, val, id << 1 | 1, mid + 1, r);
		IT[id] = IT[id << 1] + IT[id << 1 | 1];
	}
	
	Node get(int x, int y, int id, int l, int r) {
		if (l > y || r < x) return Node();
		if (x <= l && r <= y) return IT[id];
		push(id);
		int mid = (l + r) / 2;
		return get(x, y, id << 1, l, mid) + get(x, y, id << 1 | 1, mid + 1, r);
	}
	
	inline void update(int x, int y, const Node &val) {
		update(x, y, val, 1, 1, n);
	}
	
	inline Node get(int x, int y) {
		return get(x, y, 1, 1, n);
	}
} IT[lg + 3];

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> k >> m;   
	for (int i = 1; i <= n; i++)
		IT[0].update(i, i, Node(i, i));
	for (int i = 1; i <= m; i++) {
		int l, r;
		cin >> l >> r;
		if (l <= r) {
			int p = min(l + k - 1, r);
			IT[0].update(l, p, Node(N, r));
		} else {
			int p = max(l - k + 1, r);
			IT[0].update(p, l, Node(r, 0));
		}
	}
	for (int k = 1; k <= lg; k++) {
		for (int i = 1; i <= n; i++) {
			const auto &S = IT[k - 1].get(i, i);
			IT[k].update(i, i, IT[k - 1].get(S.l, S.r));
		}
	}
	cin >> q;
	while (q--) {
		int s, t, ans = 0;
		cin >> s >> t;
		if (s == t) {
			cout << "0\n";
			continue;
		}
		Node now(s, s);
		for (int k = lg; k >= 0; k--) {
			Node cur = IT[k].get(now.l, now.r);
			if (cur.l <= t && t <= cur.r) continue;
			ans += (1 << k);
			now = cur;
		}
		now = IT[0].get(now.l, now.r);
		if (now.l <= t && t <= now.r) cout << ans + 1;
		else cout << -1;
		cout << '\n';
	}
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 125524 KB Output is correct
2 Correct 25 ms 125528 KB Output is correct
3 Correct 25 ms 125532 KB Output is correct
4 Correct 25 ms 125480 KB Output is correct
5 Correct 27 ms 125648 KB Output is correct
6 Correct 24 ms 125532 KB Output is correct
7 Correct 25 ms 125640 KB Output is correct
8 Correct 28 ms 125524 KB Output is correct
9 Correct 31 ms 125868 KB Output is correct
10 Correct 23 ms 125520 KB Output is correct
11 Correct 24 ms 125560 KB Output is correct
12 Correct 25 ms 125532 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 125524 KB Output is correct
2 Correct 25 ms 125528 KB Output is correct
3 Correct 25 ms 125532 KB Output is correct
4 Correct 25 ms 125480 KB Output is correct
5 Correct 27 ms 125648 KB Output is correct
6 Correct 24 ms 125532 KB Output is correct
7 Correct 25 ms 125640 KB Output is correct
8 Correct 28 ms 125524 KB Output is correct
9 Correct 31 ms 125868 KB Output is correct
10 Correct 23 ms 125520 KB Output is correct
11 Correct 24 ms 125560 KB Output is correct
12 Correct 25 ms 125532 KB Output is correct
13 Correct 39 ms 125624 KB Output is correct
14 Correct 39 ms 125784 KB Output is correct
15 Correct 36 ms 125528 KB Output is correct
16 Correct 36 ms 125520 KB Output is correct
17 Correct 40 ms 125524 KB Output is correct
18 Correct 35 ms 125520 KB Output is correct
19 Correct 37 ms 125528 KB Output is correct
20 Correct 34 ms 125532 KB Output is correct
21 Correct 32 ms 125528 KB Output is correct
22 Correct 37 ms 125504 KB Output is correct
23 Correct 38 ms 125532 KB Output is correct
24 Correct 39 ms 125528 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 931 ms 126628 KB Output is correct
2 Correct 913 ms 126604 KB Output is correct
3 Correct 969 ms 126796 KB Output is correct
4 Correct 917 ms 126548 KB Output is correct
5 Correct 704 ms 127992 KB Output is correct
6 Correct 949 ms 128100 KB Output is correct
7 Correct 652 ms 127828 KB Output is correct
8 Correct 615 ms 126840 KB Output is correct
9 Correct 632 ms 126800 KB Output is correct
10 Correct 896 ms 127996 KB Output is correct
11 Correct 872 ms 127996 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1084 ms 127492 KB Output is correct
2 Correct 1072 ms 128484 KB Output is correct
3 Correct 1198 ms 127840 KB Output is correct
4 Correct 815 ms 128644 KB Output is correct
5 Correct 853 ms 128484 KB Output is correct
6 Correct 836 ms 128496 KB Output is correct
7 Correct 1124 ms 128572 KB Output is correct
8 Correct 1045 ms 128480 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1128 ms 128580 KB Output is correct
2 Correct 1295 ms 127840 KB Output is correct
3 Correct 1265 ms 126960 KB Output is correct
4 Correct 1239 ms 126560 KB Output is correct
5 Correct 1102 ms 126532 KB Output is correct
6 Correct 1094 ms 126340 KB Output is correct
7 Correct 976 ms 127744 KB Output is correct
8 Correct 24 ms 125532 KB Output is correct
9 Correct 41 ms 125532 KB Output is correct
10 Correct 939 ms 128100 KB Output is correct
11 Correct 1037 ms 128536 KB Output is correct
12 Correct 1032 ms 128484 KB Output is correct
13 Correct 1061 ms 128516 KB Output is correct
14 Correct 25 ms 125532 KB Output is correct
15 Correct 39 ms 125716 KB Output is correct
16 Correct 947 ms 128160 KB Output is correct
17 Correct 1280 ms 128756 KB Output is correct
18 Correct 1208 ms 128792 KB Output is correct
19 Correct 1153 ms 128480 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 125524 KB Output is correct
2 Correct 25 ms 125528 KB Output is correct
3 Correct 25 ms 125532 KB Output is correct
4 Correct 25 ms 125480 KB Output is correct
5 Correct 27 ms 125648 KB Output is correct
6 Correct 24 ms 125532 KB Output is correct
7 Correct 25 ms 125640 KB Output is correct
8 Correct 28 ms 125524 KB Output is correct
9 Correct 31 ms 125868 KB Output is correct
10 Correct 23 ms 125520 KB Output is correct
11 Correct 24 ms 125560 KB Output is correct
12 Correct 25 ms 125532 KB Output is correct
13 Correct 39 ms 125624 KB Output is correct
14 Correct 39 ms 125784 KB Output is correct
15 Correct 36 ms 125528 KB Output is correct
16 Correct 36 ms 125520 KB Output is correct
17 Correct 40 ms 125524 KB Output is correct
18 Correct 35 ms 125520 KB Output is correct
19 Correct 37 ms 125528 KB Output is correct
20 Correct 34 ms 125532 KB Output is correct
21 Correct 32 ms 125528 KB Output is correct
22 Correct 37 ms 125504 KB Output is correct
23 Correct 38 ms 125532 KB Output is correct
24 Correct 39 ms 125528 KB Output is correct
25 Correct 931 ms 126628 KB Output is correct
26 Correct 913 ms 126604 KB Output is correct
27 Correct 969 ms 126796 KB Output is correct
28 Correct 917 ms 126548 KB Output is correct
29 Correct 704 ms 127992 KB Output is correct
30 Correct 949 ms 128100 KB Output is correct
31 Correct 652 ms 127828 KB Output is correct
32 Correct 615 ms 126840 KB Output is correct
33 Correct 632 ms 126800 KB Output is correct
34 Correct 896 ms 127996 KB Output is correct
35 Correct 872 ms 127996 KB Output is correct
36 Correct 1084 ms 127492 KB Output is correct
37 Correct 1072 ms 128484 KB Output is correct
38 Correct 1198 ms 127840 KB Output is correct
39 Correct 815 ms 128644 KB Output is correct
40 Correct 853 ms 128484 KB Output is correct
41 Correct 836 ms 128496 KB Output is correct
42 Correct 1124 ms 128572 KB Output is correct
43 Correct 1045 ms 128480 KB Output is correct
44 Correct 1128 ms 128580 KB Output is correct
45 Correct 1295 ms 127840 KB Output is correct
46 Correct 1265 ms 126960 KB Output is correct
47 Correct 1239 ms 126560 KB Output is correct
48 Correct 1102 ms 126532 KB Output is correct
49 Correct 1094 ms 126340 KB Output is correct
50 Correct 976 ms 127744 KB Output is correct
51 Correct 24 ms 125532 KB Output is correct
52 Correct 41 ms 125532 KB Output is correct
53 Correct 939 ms 128100 KB Output is correct
54 Correct 1037 ms 128536 KB Output is correct
55 Correct 1032 ms 128484 KB Output is correct
56 Correct 1061 ms 128516 KB Output is correct
57 Correct 25 ms 125532 KB Output is correct
58 Correct 39 ms 125716 KB Output is correct
59 Correct 947 ms 128160 KB Output is correct
60 Correct 1280 ms 128756 KB Output is correct
61 Correct 1208 ms 128792 KB Output is correct
62 Correct 1153 ms 128480 KB Output is correct
63 Correct 1187 ms 127204 KB Output is correct
64 Correct 1302 ms 127572 KB Output is correct
65 Correct 1214 ms 127468 KB Output is correct
66 Correct 729 ms 128488 KB Output is correct
67 Correct 1168 ms 128760 KB Output is correct
68 Correct 1092 ms 128744 KB Output is correct
69 Correct 859 ms 128744 KB Output is correct
70 Correct 1135 ms 128488 KB Output is correct
71 Correct 1262 ms 129100 KB Output is correct