oj.uz

Submission #843688

# Submission time Handle Problem Language Result Execution time Memory
843688 2023-09-04T12:23:16 Z jmyszka2007 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 493 ms 51544 KB 
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
//#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#define check(x) if (!(x)) { cerr << "Check failed: " << #x << " in line " << __LINE__ << endl; exit(1); }
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#define check(x) 
#endif
typedef long long ll;
#define pi pair<int, int>
#define pl pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
constexpr int LIM = 1e5;
constexpr int lg = 17;
constexpr int base = (1 << lg);
int nxtl[LIM + 10][lg];
int nxtr[LIM + 10][lg];
int trimx[2 * base][lg];
int trimn[2 * base][lg];
int trimx2[2 * base];
int trimn2[2 * base];
void updmx(int v, int x, int k) {
	v += base;
	while(v > 0) {
		trimx[v][k] = max(trimx[v][k], x);
		v /= 2;
	} 
}
int querymx(int l, int r, int k) {
	l += base;
	r += base;
	int ans = 0;
	while(l <= r) {
		if(l & 1) {
			ans = max(ans, trimx[l][k]);
		}
		if(!(r & 1)) {
			ans = max(ans, trimx[r][k]);
		}
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
	return ans;
}
void updmn(int v, int x, int k) {
	v += base;
	while(v > 0) {
		trimn[v][k] = min(trimn[v][k], x);
		v /= 2;
	} 
}
int querymn(int l, int r, int k) {
	l += base;
	r += base;
	int ans = 1e9;
	while(l <= r) {
		if(l & 1) {
			ans = min(ans, trimn[l][k]);
		}
		if(!(r & 1)) {
			ans = min(ans, trimn[r][k]);
		}
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
	return ans;
}
void updmx2(int l, int r, int x) {
	l += base;
	r += base;
	while(l <= r) {
		if(l & 1) {
			trimx2[l] = max(trimx2[l], x);
		}
		if(!(r & 1)) {
			trimx2[r] = max(trimx2[r], x);
		}
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
}
int querymx2(int v) {
	v += base;
	int ans = 0;
	while(v > 0) {
		ans = max(ans, trimx2[v]);
		v /= 2;
	}
	return ans;
}
void updmn2(int l, int r, int x) {
	l += base;
	r += base;
	while(l <= r) {
		if(l & 1) {
			trimn2[l] = min(trimn2[l], x);
		}
		if(!(r & 1)) {
			trimn2[r] = min(trimn2[r], x);
		}
		l = (l + 1) / 2;
		r = (r - 1) / 2;
	}
}
int querymn2(int v) {
	v += base;
	int ans = 1e9;
	while(v > 0) {
		ans = min(ans, trimn2[v]);
		v /= 2;
	}
	return ans;
}
void solve() {
	//ifstream cin("nazwa.in");
	//ofstream cout("nazwa.out");
	for(int i = 0; i < 2 * base; i++) {
		trimn2[i] = 1e9;
		for(int j = 0; j < lg; j++) {
			trimn[i][j] = 1e9;
		}
	}
	for(int i = 0; i <= LIM; i++) {
		for(int j = 0; j < lg; j++) {
			nxtl[i][j] = 1e9;
		}
	}
	int n, k;
	cin >> n >> k;
	int m;
	cin >> m;
	for(int i = 1; i <= m; i++) {
		int l, r;
		cin >> l >> r;
		if(l > r) {
			updmn2(max(l - k + 1, r + 1), l, r);
		}
		else {
			updmx2(l, min(l + k - 1, r - 1), r);
		}
	}
	for(int i = 1; i <= n; i++) {
		nxtl[i][0] = min(i, querymn2(i));
		nxtr[i][0] = max(i, querymx2(i));
		debug(i, nxtl[i][0], nxtr[i][0]);
		updmn(i, nxtl[i][0], 0);
		updmx(i, nxtr[i][0], 0);
	}
	for(int j = 1; j < lg; j++) {
		debug(j);
		for(int i = 1; i <= n; i++) {
			nxtl[i][j] = querymn(nxtl[i][j - 1], nxtr[i][j - 1], j - 1);
			nxtr[i][j] = querymx(nxtl[i][j - 1], nxtr[i][j - 1], j - 1);
			debug(i, nxtl[i][j], nxtr[i][j]);
			updmn(i, nxtl[i][j], j);
			updmx(i, nxtr[i][j], j);
		}
	}
	int t;
	cin >> t;
	while(t--) {
		int l, r;
		cin >> l >> r;
		if(l == r) {
			cout << 0 << '\n';
			continue;
		}
		int aktl = l, aktr = l;
		int ans = 0;
		for(int i = lg - 1; i >= 0; i--) {
			debug(i, aktl, aktr, querymn(aktl, aktr, i));;
			if(l > r && querymn(aktl, aktr, i) > r) {
				ans += (1 << i);
				int naktl = querymn(aktl, aktr, i);
				int naktr = querymx(aktl, aktr, i);
				aktl = naktl;
				aktr = naktr;
			}
			if(l < r && querymx(aktl, aktr, i) < r) {
				ans += (1 << i);
				int naktl = querymn(aktl, aktr, i);
				int naktr = querymx(aktl, aktr, i);
				aktl = naktl;
				aktr = naktr;
			}
		}
		if(l > r && querymn(aktl, aktr, 0) <= r) {
			cout << ans + 1 << '\n';
		}
		else if(l < r && querymx(aktl, aktr, 0) >= r) {
			cout << ans + 1 << '\n';
		}
		else {
			cout << -1 << '\n';
		}
	}
}
int main() {
	fastio();
	int t;
	//cin >> t;
	t = 1;	
	while(t--) {
		solve();
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 30044 KB Output is correct
2 Correct 8 ms 30128 KB Output is correct
3 Correct 8 ms 30044 KB Output is correct
4 Correct 8 ms 30136 KB Output is correct
5 Correct 8 ms 30044 KB Output is correct
6 Correct 8 ms 30132 KB Output is correct
7 Correct 8 ms 30104 KB Output is correct
8 Correct 8 ms 30044 KB Output is correct
9 Correct 8 ms 30044 KB Output is correct
10 Correct 7 ms 30072 KB Output is correct
11 Correct 8 ms 30044 KB Output is correct
12 Correct 8 ms 30044 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 30044 KB Output is correct
2 Correct 8 ms 30128 KB Output is correct
3 Correct 8 ms 30044 KB Output is correct
4 Correct 8 ms 30136 KB Output is correct
5 Correct 8 ms 30044 KB Output is correct
6 Correct 8 ms 30132 KB Output is correct
7 Correct 8 ms 30104 KB Output is correct
8 Correct 8 ms 30044 KB Output is correct
9 Correct 8 ms 30044 KB Output is correct
10 Correct 7 ms 30072 KB Output is correct
11 Correct 8 ms 30044 KB Output is correct
12 Correct 8 ms 30044 KB Output is correct
13 Correct 14 ms 30468 KB Output is correct
14 Correct 15 ms 30620 KB Output is correct
15 Correct 11 ms 30300 KB Output is correct
16 Correct 13 ms 30384 KB Output is correct
17 Correct 11 ms 30300 KB Output is correct
18 Correct 11 ms 30300 KB Output is correct
19 Correct 11 ms 30300 KB Output is correct
20 Correct 12 ms 30300 KB Output is correct
21 Correct 11 ms 30300 KB Output is correct
22 Correct 11 ms 30356 KB Output is correct
23 Correct 12 ms 30300 KB Output is correct
24 Correct 13 ms 30632 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 48684 KB Output is correct
2 Correct 324 ms 49608 KB Output is correct
3 Correct 388 ms 50004 KB Output is correct
4 Correct 302 ms 49548 KB Output is correct
5 Correct 257 ms 51052 KB Output is correct
6 Correct 287 ms 51000 KB Output is correct
7 Correct 277 ms 50760 KB Output is correct
8 Correct 249 ms 49716 KB Output is correct
9 Correct 256 ms 49748 KB Output is correct
10 Correct 259 ms 51048 KB Output is correct
11 Correct 258 ms 50996 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 48688 KB Output is correct
2 Correct 322 ms 48704 KB Output is correct
3 Correct 358 ms 48984 KB Output is correct
4 Correct 287 ms 48688 KB Output is correct
5 Correct 293 ms 49076 KB Output is correct
6 Correct 287 ms 48720 KB Output is correct
7 Correct 289 ms 48796 KB Output is correct
8 Correct 339 ms 49000 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 48720 KB Output is correct
2 Correct 387 ms 48944 KB Output is correct
3 Correct 402 ms 49112 KB Output is correct
4 Correct 404 ms 48720 KB Output is correct
5 Correct 268 ms 48692 KB Output is correct
6 Correct 397 ms 48796 KB Output is correct
7 Correct 364 ms 48724 KB Output is correct
8 Correct 8 ms 30040 KB Output is correct
9 Correct 14 ms 30300 KB Output is correct
10 Correct 372 ms 48840 KB Output is correct
11 Correct 394 ms 48700 KB Output is correct
12 Correct 386 ms 48572 KB Output is correct
13 Correct 383 ms 48584 KB Output is correct
14 Correct 8 ms 30044 KB Output is correct
15 Correct 17 ms 30436 KB Output is correct
16 Correct 324 ms 48684 KB Output is correct
17 Correct 475 ms 48724 KB Output is correct
18 Correct 432 ms 48724 KB Output is correct
19 Correct 429 ms 48888 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 30044 KB Output is correct
2 Correct 8 ms 30128 KB Output is correct
3 Correct 8 ms 30044 KB Output is correct
4 Correct 8 ms 30136 KB Output is correct
5 Correct 8 ms 30044 KB Output is correct
6 Correct 8 ms 30132 KB Output is correct
7 Correct 8 ms 30104 KB Output is correct
8 Correct 8 ms 30044 KB Output is correct
9 Correct 8 ms 30044 KB Output is correct
10 Correct 7 ms 30072 KB Output is correct
11 Correct 8 ms 30044 KB Output is correct
12 Correct 8 ms 30044 KB Output is correct
13 Correct 14 ms 30468 KB Output is correct
14 Correct 15 ms 30620 KB Output is correct
15 Correct 11 ms 30300 KB Output is correct
16 Correct 13 ms 30384 KB Output is correct
17 Correct 11 ms 30300 KB Output is correct
18 Correct 11 ms 30300 KB Output is correct
19 Correct 11 ms 30300 KB Output is correct
20 Correct 12 ms 30300 KB Output is correct
21 Correct 11 ms 30300 KB Output is correct
22 Correct 11 ms 30356 KB Output is correct
23 Correct 12 ms 30300 KB Output is correct
24 Correct 13 ms 30632 KB Output is correct
25 Correct 323 ms 48684 KB Output is correct
26 Correct 324 ms 49608 KB Output is correct
27 Correct 388 ms 50004 KB Output is correct
28 Correct 302 ms 49548 KB Output is correct
29 Correct 257 ms 51052 KB Output is correct
30 Correct 287 ms 51000 KB Output is correct
31 Correct 277 ms 50760 KB Output is correct
32 Correct 249 ms 49716 KB Output is correct
33 Correct 256 ms 49748 KB Output is correct
34 Correct 259 ms 51048 KB Output is correct
35 Correct 258 ms 50996 KB Output is correct
36 Correct 319 ms 48688 KB Output is correct
37 Correct 322 ms 48704 KB Output is correct
38 Correct 358 ms 48984 KB Output is correct
39 Correct 287 ms 48688 KB Output is correct
40 Correct 293 ms 49076 KB Output is correct
41 Correct 287 ms 48720 KB Output is correct
42 Correct 289 ms 48796 KB Output is correct
43 Correct 339 ms 49000 KB Output is correct
44 Correct 460 ms 48720 KB Output is correct
45 Correct 387 ms 48944 KB Output is correct
46 Correct 402 ms 49112 KB Output is correct
47 Correct 404 ms 48720 KB Output is correct
48 Correct 268 ms 48692 KB Output is correct
49 Correct 397 ms 48796 KB Output is correct
50 Correct 364 ms 48724 KB Output is correct
51 Correct 8 ms 30040 KB Output is correct
52 Correct 14 ms 30300 KB Output is correct
53 Correct 372 ms 48840 KB Output is correct
54 Correct 394 ms 48700 KB Output is correct
55 Correct 386 ms 48572 KB Output is correct
56 Correct 383 ms 48584 KB Output is correct
57 Correct 8 ms 30044 KB Output is correct
58 Correct 17 ms 30436 KB Output is correct
59 Correct 324 ms 48684 KB Output is correct
60 Correct 475 ms 48724 KB Output is correct
61 Correct 432 ms 48724 KB Output is correct
62 Correct 429 ms 48888 KB Output is correct
63 Correct 406 ms 50212 KB Output is correct
64 Correct 493 ms 50468 KB Output is correct
65 Correct 422 ms 50204 KB Output is correct
66 Correct 341 ms 51540 KB Output is correct
67 Correct 413 ms 51540 KB Output is correct
68 Correct 284 ms 51540 KB Output is correct
69 Correct 285 ms 51500 KB Output is correct
70 Correct 320 ms 51492 KB Output is correct
71 Correct 352 ms 51544 KB Output is correct