oj.uz

Submission #937918

# Submission time Handle Problem Language Result Execution time Memory
937918 2024-03-04T16:43:28 Z vjudge1 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 333 ms 271652 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxN = 100000;
const int LOG = 17;

int lb[maxN+1];

void precalcLb(){
	int pw = -1;
	int curr = 1;
	for(int i = 1; i <= maxN; i++){
		if(i == curr){
			curr *= 2;
			pw++;
		}
		lb[i] = pw;
	}
}

void buildSparse(vector<vector<pair<int, int>>>& sparse, vector<pair<int, int>>& dp){
	int N = (int)dp.size();
	for(int k = 0; k < LOG; k++){
		for(int i = 0; i < N; i++){
			if(k == 0) sparse[k][i] = dp[i];
			else{
				if(i - (1 << (k-1)) < 0) sparse[k][i] = sparse[k-1][i];
				else{
					sparse[k][i].first = min(sparse[k-1][i].first, sparse[k-1][i - (1 << (k-1))].first);
					sparse[k][i].second = max(sparse[k-1][i].second, sparse[k-1][i - (1 << (k-1))].second);
				}
			}
		}
	}
}

pair<int, int> querySparse(vector<vector<pair<int, int>>>& sparse, int l, int r){
	int k = lb[r - l + 1];
	pair<int, int> p1 = sparse[k][r];
	pair<int, int> p2 = sparse[k][l + (1 << k) - 1];
	// cout << "l "<< l << " r "<< r << " " << min(p1.first, p2.first) << " " << max(p1.second, p2.second) << " k "<< k << "\n";
	return {min(p1.first, p2.first), max(p1.second, p2.second)};
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	precalcLb();

	int N, K, M; cin >> N >> K >> M;
	vector<pair<int, int>> mx(N);
	for(int i = 0; i < N; i++) mx[i] = {i, i};
	vector<tuple<int, int, int>> inv;
	for(int i = 0; i < M; i++){
		int A, B; cin >> A >> B; A--; B--;
		if(A < B){
			inv.push_back({A, min(A + K - 1, B - 1), B});
		}else{
			inv.push_back({max(A - K + 1, B + 1), A, B});
		}
	}
	sort(inv.begin(), inv.end());
	// cout << "Inv:\n";
	// for(tuple<int, int, int> t : inv){
	// 	cout << get<0>(t) << " " << get<1>(t) << " " << get<2>(t) << "\n";
	// }
	multiset<int> elems;
	vector<vector<int>> eras(N+1);
	int ind = 0;
	for(int i = 0; i < N; i++){
		while(ind < M && get<0>(inv[ind]) == i){
			int r = get<1>(inv[ind]);
			int val = get<2>(inv[ind]);
			elems.insert(val);
			eras[r+1].push_back(val);
			ind++;
		}
		for(int x : eras[i]) elems.erase(elems.find(x));
		if(elems.empty()) continue;
		mx[i].first = min(mx[i].first, *elems.begin());
		mx[i].second = max(mx[i].second, *elems.rbegin());
	}
	// cout << "here\n";
	// cout << "Mx:\n";
	// for(int i = 0; i < N; i++){
	// 	cout << "i "<< i << " " << mx[i].first << " " << mx[i].second << endl;
	// }
	// return 0;
	vector<vector<pair<int, int>>> dp(LOG, vector<pair<int, int>>(N));
	vector<vector<vector<pair<int, int>>>> sparse(LOG, vector<vector<pair<int, int>>> (LOG, vector<pair<int, int>>(N)));
	dp[0] = mx;
	buildSparse(sparse[0], dp[0]);
	// cout << "k "<< 0 << " dp:\n";
	// for(int i = 0; i < N; i++) cout << "i: " << i << " " << dp[0][i].first << " " << dp[0][i].second << "\n";
	for(int k = 1; k < LOG; k++){
		for(int i = 0; i < N; i++){
			dp[k][i] = querySparse(sparse[k-1], dp[k-1][i].first, dp[k-1][i].second);
		}
		// cout << "k "<< k << " dp:\n";
		// for(int i = 0; i < N; i++) cout << "i: " << i << " " << dp[k][i].first << " " << dp[k][i].second << "\n";
		// break;
		buildSparse(sparse[k], dp[k]);
	}
	// return 0;
	int Q; cin >> Q;
	while(Q--){
		int S, T; cin >> S >> T; S--; T--;
		int ans = -1;
		int curr = 0;
		pair<int, int> currInv = {S, S};
		for(int k = LOG - 1; k >= 0; k--){
			pair<int, int> p = querySparse(sparse[k], currInv.first, currInv.second);
			if(p.first <= T && p.second >= T){
				ans = curr + (1 << k);
			}else{
				curr += (1 << k);
				currInv = p;
			}
		}
		cout << ans << "\n";
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1632 KB Output is correct
2 Correct 1 ms 1632 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1624 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1632 KB Output is correct
2 Correct 1 ms 1632 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1624 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 7 ms 5980 KB Output is correct
14 Correct 5 ms 5980 KB Output is correct
15 Correct 4 ms 5848 KB Output is correct
16 Correct 6 ms 6236 KB Output is correct
17 Correct 5 ms 5976 KB Output is correct
18 Correct 5 ms 5976 KB Output is correct
19 Correct 5 ms 5724 KB Output is correct
20 Correct 5 ms 5980 KB Output is correct
21 Correct 5 ms 5980 KB Output is correct
22 Correct 5 ms 5980 KB Output is correct
23 Correct 5 ms 5980 KB Output is correct
24 Correct 5 ms 5980 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 261900 KB Output is correct
2 Correct 205 ms 261756 KB Output is correct
3 Correct 191 ms 262920 KB Output is correct
4 Correct 189 ms 261524 KB Output is correct
5 Correct 281 ms 267200 KB Output is correct
6 Correct 244 ms 265256 KB Output is correct
7 Correct 253 ms 270784 KB Output is correct
8 Correct 225 ms 261052 KB Output is correct
9 Correct 226 ms 263860 KB Output is correct
10 Correct 235 ms 264952 KB Output is correct
11 Correct 240 ms 265152 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 263888 KB Output is correct
2 Correct 304 ms 268224 KB Output is correct
3 Correct 225 ms 262316 KB Output is correct
4 Correct 265 ms 271652 KB Output is correct
5 Correct 333 ms 267724 KB Output is correct
6 Correct 314 ms 270376 KB Output is correct
7 Correct 258 ms 265576 KB Output is correct
8 Correct 309 ms 265664 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 268192 KB Output is correct
2 Correct 282 ms 263928 KB Output is correct
3 Correct 259 ms 261372 KB Output is correct
4 Correct 246 ms 259288 KB Output is correct
5 Correct 218 ms 258624 KB Output is correct
6 Correct 199 ms 258252 KB Output is correct
7 Correct 214 ms 262160 KB Output is correct
8 Correct 2 ms 1624 KB Output is correct
9 Correct 5 ms 5976 KB Output is correct
10 Correct 304 ms 266492 KB Output is correct
11 Correct 289 ms 269796 KB Output is correct
12 Correct 307 ms 264136 KB Output is correct
13 Correct 323 ms 269644 KB Output is correct
14 Correct 1 ms 1624 KB Output is correct
15 Correct 7 ms 5980 KB Output is correct
16 Correct 236 ms 264896 KB Output is correct
17 Correct 313 ms 265864 KB Output is correct
18 Correct 276 ms 266068 KB Output is correct
19 Correct 269 ms 266176 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1632 KB Output is correct
2 Correct 1 ms 1632 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1624 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 7 ms 5980 KB Output is correct
14 Correct 5 ms 5980 KB Output is correct
15 Correct 4 ms 5848 KB Output is correct
16 Correct 6 ms 6236 KB Output is correct
17 Correct 5 ms 5976 KB Output is correct
18 Correct 5 ms 5976 KB Output is correct
19 Correct 5 ms 5724 KB Output is correct
20 Correct 5 ms 5980 KB Output is correct
21 Correct 5 ms 5980 KB Output is correct
22 Correct 5 ms 5980 KB Output is correct
23 Correct 5 ms 5980 KB Output is correct
24 Correct 5 ms 5980 KB Output is correct
25 Correct 219 ms 261900 KB Output is correct
26 Correct 205 ms 261756 KB Output is correct
27 Correct 191 ms 262920 KB Output is correct
28 Correct 189 ms 261524 KB Output is correct
29 Correct 281 ms 267200 KB Output is correct
30 Correct 244 ms 265256 KB Output is correct
31 Correct 253 ms 270784 KB Output is correct
32 Correct 225 ms 261052 KB Output is correct
33 Correct 226 ms 263860 KB Output is correct
34 Correct 235 ms 264952 KB Output is correct
35 Correct 240 ms 265152 KB Output is correct
36 Correct 234 ms 263888 KB Output is correct
37 Correct 304 ms 268224 KB Output is correct
38 Correct 225 ms 262316 KB Output is correct
39 Correct 265 ms 271652 KB Output is correct
40 Correct 333 ms 267724 KB Output is correct
41 Correct 314 ms 270376 KB Output is correct
42 Correct 258 ms 265576 KB Output is correct
43 Correct 309 ms 265664 KB Output is correct
44 Correct 318 ms 268192 KB Output is correct
45 Correct 282 ms 263928 KB Output is correct
46 Correct 259 ms 261372 KB Output is correct
47 Correct 246 ms 259288 KB Output is correct
48 Correct 218 ms 258624 KB Output is correct
49 Correct 199 ms 258252 KB Output is correct
50 Correct 214 ms 262160 KB Output is correct
51 Correct 2 ms 1624 KB Output is correct
52 Correct 5 ms 5976 KB Output is correct
53 Correct 304 ms 266492 KB Output is correct
54 Correct 289 ms 269796 KB Output is correct
55 Correct 307 ms 264136 KB Output is correct
56 Correct 323 ms 269644 KB Output is correct
57 Correct 1 ms 1624 KB Output is correct
58 Correct 7 ms 5980 KB Output is correct
59 Correct 236 ms 264896 KB Output is correct
60 Correct 313 ms 265864 KB Output is correct
61 Correct 276 ms 266068 KB Output is correct
62 Correct 269 ms 266176 KB Output is correct
63 Correct 254 ms 262268 KB Output is correct
64 Correct 240 ms 263240 KB Output is correct
65 Correct 242 ms 262412 KB Output is correct
66 Correct 303 ms 267708 KB Output is correct
67 Correct 263 ms 266004 KB Output is correct
68 Correct 293 ms 263792 KB Output is correct
69 Correct 309 ms 270240 KB Output is correct
70 Correct 270 ms 265596 KB Output is correct
71 Correct 292 ms 265668 KB Output is correct