oj.uz

Submission #528369

# Submission time Handle Problem Language Result Execution time Memory
528369 2022-02-20T07:50:02 Z 8e7 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 707 ms 67436 KB 
//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
const int inf = 1<<30;
pii ed[200005];
vector<pii> el[maxn], er[maxn];

struct segtree{
	pii seg[4*maxn];
	void pull(int cur) {
		seg[cur] = {min(seg[cur*2].ff, seg[cur*2+1].ff), max(seg[cur*2].ss, seg[cur*2+1].ss)};
	}
	void init(int cur, int l, int r, pii arr[]){
		if (r <= l) return;
		if (r - l == 1) {
			seg[cur] = arr[l]; 
			return;
		}
		int m = (l + r) / 2;
		init(cur*2, l, m, arr), init(cur*2+1, m, r, arr);
		pull(cur);	
	}
	pii query(int cur, int l, int r, int ql, int qr) {
		if (r <= l || ql >= r || qr <= l) return make_pair(inf, 0);
		if (ql <= l && qr >= r) return seg[cur];
		int m = (l + r) / 2;
		pii le = query(cur*2, l, m, ql, qr), ri = query(cur*2+1, m, r, ql, qr);
		return make_pair(min(le.ff, ri.ff), max(le.ss, ri.ss));
	}
} tr[17];
pii ran[17][maxn];
int main() {
	io
	int n, k, m;
	cin >> n >> k >> m;
	for (int i = 0;i < m;i++) {
		cin >> ed[i].ff >> ed[i].ss;
		if (ed[i].ss > ed[i].ff) {
			er[min(ed[i].ss-1, ed[i].ff + k - 1)].push_back({ed[i].ss, 1});
			er[ed[i].ff - 1].push_back({ed[i].ss, -1});
		} else {
			el[max(ed[i].ss+1, ed[i].ff - k + 1)].push_back({ed[i].ss, 1});
			el[ed[i].ff + 1].push_back({ed[i].ss, -1});
		}
	}
	multiset<int> se;
	for (int i = 1;i <= n;i++) {
		for (auto p:el[i]) {
			if (p.ss == 1) se.insert(p.ff);	
			else se.erase(se.find(p.ff));
		}
		ran[0][i].ff = (se.size() ? *se.begin() : i);
	}
	se.clear();
	for (int i = n;i >= 1;i--) {
		for (auto p:er[i]) {
			if (p.ss == 1) se.insert(p.ff);	
			else se.erase(se.find(p.ff));
		}
		ran[0][i].ss = (se.size() ? *prev(se.end()) : i);
	}
	tr[0].init(1, 1, n+1, ran[0]);
	for (int i = 1;i < 17;i++) {
		for (int j = 1;j <= n;j++) {
			ran[i][j] = tr[i-1].query(1, 1, n+1, ran[i-1][j].ff, ran[i-1][j].ss+1);
		}
		tr[i].init(1, 1, n+1, ran[i]);
	}
	int q;
	cin >> q;
	while (q--) {
		int s, t;
		cin >> s >> t;
		int ans = 0;
		pii cur = {s, s};
		for (int i = 16;i >= 0;i--) {
			pii nxt = tr[i].query(1, 1, n+1, cur.ff, cur.ss+1);	
			if (t < nxt.ff || t > nxt.ss) {
				cur = nxt;
				ans += 1<<i;
			}
		}
		pii nxt = tr[0].query(1, 1, n+1, cur.ff, cur.ss+1);
		if (nxt.ff <= t && t <= nxt.ss) {
			cout << ans+1 << "\n";
		} else {
			cout << -1 << "\n";
		}
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5324 KB Output is correct
2 Correct 4 ms 5324 KB Output is correct
3 Correct 3 ms 5324 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 4 ms 5324 KB Output is correct
6 Correct 4 ms 5452 KB Output is correct
7 Correct 4 ms 5324 KB Output is correct
8 Correct 3 ms 5324 KB Output is correct
9 Correct 3 ms 5324 KB Output is correct
10 Correct 2 ms 5196 KB Output is correct
11 Correct 4 ms 5324 KB Output is correct
12 Correct 3 ms 5324 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5324 KB Output is correct
2 Correct 4 ms 5324 KB Output is correct
3 Correct 3 ms 5324 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 4 ms 5324 KB Output is correct
6 Correct 4 ms 5452 KB Output is correct
7 Correct 4 ms 5324 KB Output is correct
8 Correct 3 ms 5324 KB Output is correct
9 Correct 3 ms 5324 KB Output is correct
10 Correct 2 ms 5196 KB Output is correct
11 Correct 4 ms 5324 KB Output is correct
12 Correct 3 ms 5324 KB Output is correct
13 Correct 13 ms 6220 KB Output is correct
14 Correct 13 ms 6108 KB Output is correct
15 Correct 7 ms 6092 KB Output is correct
16 Correct 7 ms 6144 KB Output is correct
17 Correct 12 ms 6092 KB Output is correct
18 Correct 8 ms 6096 KB Output is correct
19 Correct 9 ms 6176 KB Output is correct
20 Correct 7 ms 6092 KB Output is correct
21 Correct 4 ms 6092 KB Output is correct
22 Correct 10 ms 6172 KB Output is correct
23 Correct 10 ms 6168 KB Output is correct
24 Correct 13 ms 6160 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 56824 KB Output is correct
2 Correct 351 ms 56792 KB Output is correct
3 Correct 395 ms 57236 KB Output is correct
4 Correct 338 ms 56656 KB Output is correct
5 Correct 191 ms 63036 KB Output is correct
6 Correct 413 ms 61144 KB Output is correct
7 Correct 136 ms 67336 KB Output is correct
8 Correct 109 ms 59332 KB Output is correct
9 Correct 115 ms 59480 KB Output is correct
10 Correct 389 ms 61860 KB Output is correct
11 Correct 349 ms 61788 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 59660 KB Output is correct
2 Correct 515 ms 63256 KB Output is correct
3 Correct 626 ms 57420 KB Output is correct
4 Correct 295 ms 67436 KB Output is correct
5 Correct 318 ms 64256 KB Output is correct
6 Correct 322 ms 64324 KB Output is correct
7 Correct 571 ms 62016 KB Output is correct
8 Correct 534 ms 62240 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 63412 KB Output is correct
2 Correct 694 ms 57712 KB Output is correct
3 Correct 695 ms 55492 KB Output is correct
4 Correct 631 ms 54304 KB Output is correct
5 Correct 538 ms 53816 KB Output is correct
6 Correct 540 ms 53464 KB Output is correct
7 Correct 386 ms 62772 KB Output is correct
8 Correct 3 ms 5324 KB Output is correct
9 Correct 9 ms 6092 KB Output is correct
10 Correct 371 ms 64360 KB Output is correct
11 Correct 479 ms 65604 KB Output is correct
12 Correct 508 ms 63788 KB Output is correct
13 Correct 496 ms 65604 KB Output is correct
14 Correct 3 ms 5324 KB Output is correct
15 Correct 11 ms 6068 KB Output is correct
16 Correct 404 ms 61076 KB Output is correct
17 Correct 681 ms 61344 KB Output is correct
18 Correct 643 ms 61492 KB Output is correct
19 Correct 598 ms 61316 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5324 KB Output is correct
2 Correct 4 ms 5324 KB Output is correct
3 Correct 3 ms 5324 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 4 ms 5324 KB Output is correct
6 Correct 4 ms 5452 KB Output is correct
7 Correct 4 ms 5324 KB Output is correct
8 Correct 3 ms 5324 KB Output is correct
9 Correct 3 ms 5324 KB Output is correct
10 Correct 2 ms 5196 KB Output is correct
11 Correct 4 ms 5324 KB Output is correct
12 Correct 3 ms 5324 KB Output is correct
13 Correct 13 ms 6220 KB Output is correct
14 Correct 13 ms 6108 KB Output is correct
15 Correct 7 ms 6092 KB Output is correct
16 Correct 7 ms 6144 KB Output is correct
17 Correct 12 ms 6092 KB Output is correct
18 Correct 8 ms 6096 KB Output is correct
19 Correct 9 ms 6176 KB Output is correct
20 Correct 7 ms 6092 KB Output is correct
21 Correct 4 ms 6092 KB Output is correct
22 Correct 10 ms 6172 KB Output is correct
23 Correct 10 ms 6168 KB Output is correct
24 Correct 13 ms 6160 KB Output is correct
25 Correct 390 ms 56824 KB Output is correct
26 Correct 351 ms 56792 KB Output is correct
27 Correct 395 ms 57236 KB Output is correct
28 Correct 338 ms 56656 KB Output is correct
29 Correct 191 ms 63036 KB Output is correct
30 Correct 413 ms 61144 KB Output is correct
31 Correct 136 ms 67336 KB Output is correct
32 Correct 109 ms 59332 KB Output is correct
33 Correct 115 ms 59480 KB Output is correct
34 Correct 389 ms 61860 KB Output is correct
35 Correct 349 ms 61788 KB Output is correct
36 Correct 477 ms 59660 KB Output is correct
37 Correct 515 ms 63256 KB Output is correct
38 Correct 626 ms 57420 KB Output is correct
39 Correct 295 ms 67436 KB Output is correct
40 Correct 318 ms 64256 KB Output is correct
41 Correct 322 ms 64324 KB Output is correct
42 Correct 571 ms 62016 KB Output is correct
43 Correct 534 ms 62240 KB Output is correct
44 Correct 555 ms 63412 KB Output is correct
45 Correct 694 ms 57712 KB Output is correct
46 Correct 695 ms 55492 KB Output is correct
47 Correct 631 ms 54304 KB Output is correct
48 Correct 538 ms 53816 KB Output is correct
49 Correct 540 ms 53464 KB Output is correct
50 Correct 386 ms 62772 KB Output is correct
51 Correct 3 ms 5324 KB Output is correct
52 Correct 9 ms 6092 KB Output is correct
53 Correct 371 ms 64360 KB Output is correct
54 Correct 479 ms 65604 KB Output is correct
55 Correct 508 ms 63788 KB Output is correct
56 Correct 496 ms 65604 KB Output is correct
57 Correct 3 ms 5324 KB Output is correct
58 Correct 11 ms 6068 KB Output is correct
59 Correct 404 ms 61076 KB Output is correct
60 Correct 681 ms 61344 KB Output is correct
61 Correct 643 ms 61492 KB Output is correct
62 Correct 598 ms 61316 KB Output is correct
63 Correct 617 ms 56876 KB Output is correct
64 Correct 707 ms 57456 KB Output is correct
65 Correct 624 ms 56940 KB Output is correct
66 Correct 224 ms 63164 KB Output is correct
67 Correct 604 ms 61860 KB Output is correct
68 Correct 494 ms 62260 KB Output is correct
69 Correct 339 ms 64252 KB Output is correct
70 Correct 581 ms 62164 KB Output is correct
71 Correct 667 ms 62016 KB Output is correct