oj.uz

Submission #529898

# Submission time Handle Problem Language Result Execution time Memory
529898 2022-02-24T01:49:30 Z fhvirus Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 334 ms 40288 KB 
#include <bits/stdc++.h>
using namespace std;

struct MinMax {
	int mn, mx;
	MinMax (int _mn = INT_MAX, int _mx = INT_MIN):
		mn(_mn), mx(_mx) {}
	const MinMax operator + (const MinMax& o) const
	{ return MinMax(min(mn, o.mn), max(mx, o.mx)); }
};
struct SGT {
	int n; vector<MinMax> val;
	SGT (const vector<MinMax>& v): n(v.size()), val(n * 2) {
		for (int i = 0; i < n; ++i) val[i + n] = v[i];
		for (int i = n - 1; i > 0; --i) val[i] = val[i << 1] + val[i << 1 | 1];
	}
	MinMax query(int l, int r) const {
		MinMax res;
		for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
			if (l & 1) res = res + val[l++];
			if (r & 1) res = res + val[--r];
		}
		return res;
	}
};

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

	int N, K, M; cin >> N >> K >> M;

	vector<vector<int>> ono(N + 2);
	for (int A, B, lb, rb, i = 1; i <= M; ++i) {
		cin >> A >> B;
		if (A < B)
			lb = A, rb = min(A + K, B);
		else
			rb = A + 1, lb = max(B + 1, A - K + 1);
		ono[lb].emplace_back( B);
		ono[rb].emplace_back(-B);
	}

	vector<MinMax> go(1);
	go.reserve(N + 1);
	multiset<int> ms;
	for (int i = 1; i <= N; ++i) {
		for (const int& v: ono[i]) {
			if (v > 0)
				ms.insert(v);
			else
				ms.erase(ms.find(-v));
		}
		int mn = i, mx = i;
		if (!ms.empty()) {
			mn = min(mn, *begin(ms));
			mx = max(mx, *rbegin(ms));
		}
		go.emplace_back(mn, mx);
	}

	int lg = __lg(N) + 1;
	vector<SGT> jmp(1, go);
	for (int l = 1; l <= lg; ++l) {
		for (int i = 1; i <= N; ++i) {
			MinMax tmp = jmp[l - 1].query(i, i);
			go[i] = jmp[l - 1].query(tmp.mn, tmp.mx);
		}
		jmp.emplace_back(go);
	}

	int Q; cin >> Q;
	for (int S, T, i = 1; i <= Q; ++i) {
		cin >> S >> T;
		MinMax range = jmp[lg].query(S, S);
		if (range.mn > T or T > range.mx) {
			cout << -1 << '\n';
			continue;
		}
		range = MinMax(S, S);
		int ans = 0;
		for (int l = lg; l >= 0; --l) {
			MinMax tmp = jmp[l].query(range.mn, range.mx);
			if (tmp.mn > T or T > tmp.mx) {
				ans += (1 << l);
				range = tmp;
			}
		}
		cout << ans + 1 << '\n';
	}
	

	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 4 ms 844 KB Output is correct
14 Correct 3 ms 828 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 3 ms 804 KB Output is correct
17 Correct 3 ms 840 KB Output is correct
18 Correct 3 ms 844 KB Output is correct
19 Correct 3 ms 840 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 4 ms 816 KB Output is correct
23 Correct 3 ms 716 KB Output is correct
24 Correct 3 ms 824 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 34596 KB Output is correct
2 Correct 150 ms 34632 KB Output is correct
3 Correct 171 ms 34768 KB Output is correct
4 Correct 140 ms 34668 KB Output is correct
5 Correct 208 ms 38056 KB Output is correct
6 Correct 169 ms 35084 KB Output is correct
7 Correct 176 ms 37172 KB Output is correct
8 Correct 140 ms 36148 KB Output is correct
9 Correct 172 ms 36776 KB Output is correct
10 Correct 196 ms 35956 KB Output is correct
11 Correct 196 ms 35896 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 35616 KB Output is correct
2 Correct 237 ms 38400 KB Output is correct
3 Correct 237 ms 33600 KB Output is correct
4 Correct 196 ms 37408 KB Output is correct
5 Correct 267 ms 40288 KB Output is correct
6 Correct 239 ms 39424 KB Output is correct
7 Correct 268 ms 36048 KB Output is correct
8 Correct 297 ms 36176 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 38308 KB Output is correct
2 Correct 243 ms 35056 KB Output is correct
3 Correct 212 ms 33532 KB Output is correct
4 Correct 217 ms 32504 KB Output is correct
5 Correct 130 ms 32144 KB Output is correct
6 Correct 229 ms 31880 KB Output is correct
7 Correct 205 ms 35448 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 844 KB Output is correct
10 Correct 279 ms 38608 KB Output is correct
11 Correct 275 ms 38896 KB Output is correct
12 Correct 334 ms 38436 KB Output is correct
13 Correct 268 ms 40232 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 4 ms 828 KB Output is correct
16 Correct 211 ms 35860 KB Output is correct
17 Correct 290 ms 36120 KB Output is correct
18 Correct 302 ms 36004 KB Output is correct
19 Correct 273 ms 36136 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 268 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 4 ms 844 KB Output is correct
14 Correct 3 ms 828 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 3 ms 804 KB Output is correct
17 Correct 3 ms 840 KB Output is correct
18 Correct 3 ms 844 KB Output is correct
19 Correct 3 ms 840 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 4 ms 816 KB Output is correct
23 Correct 3 ms 716 KB Output is correct
24 Correct 3 ms 824 KB Output is correct
25 Correct 147 ms 34596 KB Output is correct
26 Correct 150 ms 34632 KB Output is correct
27 Correct 171 ms 34768 KB Output is correct
28 Correct 140 ms 34668 KB Output is correct
29 Correct 208 ms 38056 KB Output is correct
30 Correct 169 ms 35084 KB Output is correct
31 Correct 176 ms 37172 KB Output is correct
32 Correct 140 ms 36148 KB Output is correct
33 Correct 172 ms 36776 KB Output is correct
34 Correct 196 ms 35956 KB Output is correct
35 Correct 196 ms 35896 KB Output is correct
36 Correct 215 ms 35616 KB Output is correct
37 Correct 237 ms 38400 KB Output is correct
38 Correct 237 ms 33600 KB Output is correct
39 Correct 196 ms 37408 KB Output is correct
40 Correct 267 ms 40288 KB Output is correct
41 Correct 239 ms 39424 KB Output is correct
42 Correct 268 ms 36048 KB Output is correct
43 Correct 297 ms 36176 KB Output is correct
44 Correct 297 ms 38308 KB Output is correct
45 Correct 243 ms 35056 KB Output is correct
46 Correct 212 ms 33532 KB Output is correct
47 Correct 217 ms 32504 KB Output is correct
48 Correct 130 ms 32144 KB Output is correct
49 Correct 229 ms 31880 KB Output is correct
50 Correct 205 ms 35448 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 3 ms 844 KB Output is correct
53 Correct 279 ms 38608 KB Output is correct
54 Correct 275 ms 38896 KB Output is correct
55 Correct 334 ms 38436 KB Output is correct
56 Correct 268 ms 40232 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 4 ms 828 KB Output is correct
59 Correct 211 ms 35860 KB Output is correct
60 Correct 290 ms 36120 KB Output is correct
61 Correct 302 ms 36004 KB Output is correct
62 Correct 273 ms 36136 KB Output is correct
63 Correct 210 ms 34600 KB Output is correct
64 Correct 263 ms 34828 KB Output is correct
65 Correct 229 ms 34808 KB Output is correct
66 Correct 230 ms 38620 KB Output is correct
67 Correct 244 ms 34984 KB Output is correct
68 Correct 207 ms 36048 KB Output is correct
69 Correct 291 ms 38972 KB Output is correct
70 Correct 200 ms 35992 KB Output is correct
71 Correct 267 ms 36116 KB Output is correct