#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(51);
#define ll long long
#define pb push_back
#define ld long double
const int INF = 1e9;
struct SparseTable {
int n;
vector<vector<int>> po_min, po_max;
vector<int> lg;
SparseTable(vector<int> a) {
n = a.size();
lg.resize(n + 1);
po_min.resize(20);
po_max.resize(20);
for (int i = 0; i < 20; i++) {
po_min[i].resize(n);
po_max[i].resize(n);
if ((1 << i) <= n) {
lg[1 << i] = i;
}
}
for (int i = 1; i <= n; i++) {
lg[i] = max(lg[i], lg[i - 1]);
}
for (int i = 0; i < n; i++) {
po_min[0][i] = po_max[0][i] = a[i];
}
for (int i = 1; i < 20; i++) {
for (int j = 0; j + (1 << i) <= n; j++) {
po_min[i][j] = min(po_min[i - 1][j], po_min[i - 1][j + (1 << (i - 1))]);
po_max[i][j] = max(po_max[i - 1][j], po_max[i - 1][j + (1 << (i - 1))]);
}
}
}
int get_min(int l, int r) {
int d = lg[r - l + 1];
return min(po_min[d][l], po_min[d][r - (1 << d) + 1]);
}
int get_max(int l, int r) {
int d = lg[r - l + 1];
return max(po_max[d][l], po_max[d][r - (1 << d) + 1]);
}
};
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k, m;
cin >> n >> k >> m;
vector<int> a(m), b(m);
vector<vector<int>> add_l(n + 1), add_r(n + 1), del_l(n + 1), del_r(n + 1);
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
a[i]--, b[i]--;
if (a[i] < b[i]) {
add_r[a[i]].pb(b[i]);
del_r[min(b[i], a[i] + k)].pb(b[i]);
} else {
add_l[max(b[i], a[i] - k + 1)].pb(b[i]);
del_l[a[i] + 1].pb(b[i]);
}
}
multiset<int> st_r{-INF}, st_l{INF};
vector<int> up_l(n), up_r(n);
for (int i = 0; i < n; i++) {
for (auto to : add_r[i]) {
st_r.insert(to);
}
for (auto to : del_r[i]) {
st_r.erase(st_r.find(to));
}
up_r[i] = *st_r.rbegin();
for (auto to : add_l[i]) {
st_l.insert(to);
}
for (auto to : del_l[i]) {
st_l.erase(st_l.find(to));
}
up_l[i] = *st_l.begin();
}
SparseTable L(up_l), R(up_r);
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int s, t;
cin >> s >> t;
s--, t--;
pair<int,int> seg{s, s};
int ans = 0;
while (!(seg.first <= t && t <= seg.second)) {
pair<int,int> new_seg{min(seg.first, L.get_min(seg.first, seg.second)), max(seg.second, R.get_max(seg.first, seg.second))};
if (seg == new_seg) {
ans = -1;
break;
}
seg = new_seg;
ans++;
}
cout << ans << endl;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
1 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
2 ms |
468 KB |
Output is correct |
7 |
Correct |
1 ms |
468 KB |
Output is correct |
8 |
Correct |
1 ms |
468 KB |
Output is correct |
9 |
Correct |
1 ms |
468 KB |
Output is correct |
10 |
Correct |
0 ms |
320 KB |
Output is correct |
11 |
Correct |
2 ms |
468 KB |
Output is correct |
12 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
1 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
2 ms |
468 KB |
Output is correct |
7 |
Correct |
1 ms |
468 KB |
Output is correct |
8 |
Correct |
1 ms |
468 KB |
Output is correct |
9 |
Correct |
1 ms |
468 KB |
Output is correct |
10 |
Correct |
0 ms |
320 KB |
Output is correct |
11 |
Correct |
2 ms |
468 KB |
Output is correct |
12 |
Correct |
1 ms |
468 KB |
Output is correct |
13 |
Correct |
19 ms |
1236 KB |
Output is correct |
14 |
Correct |
14 ms |
1236 KB |
Output is correct |
15 |
Correct |
2 ms |
1236 KB |
Output is correct |
16 |
Correct |
6 ms |
1236 KB |
Output is correct |
17 |
Correct |
8 ms |
1364 KB |
Output is correct |
18 |
Correct |
5 ms |
1236 KB |
Output is correct |
19 |
Correct |
4 ms |
1236 KB |
Output is correct |
20 |
Correct |
6 ms |
1232 KB |
Output is correct |
21 |
Correct |
3 ms |
1236 KB |
Output is correct |
22 |
Correct |
5 ms |
1332 KB |
Output is correct |
23 |
Correct |
7 ms |
1232 KB |
Output is correct |
24 |
Correct |
5 ms |
1364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
98 ms |
48744 KB |
Output is correct |
2 |
Correct |
97 ms |
49540 KB |
Output is correct |
3 |
Correct |
84 ms |
50856 KB |
Output is correct |
4 |
Correct |
62 ms |
49128 KB |
Output is correct |
5 |
Correct |
225 ms |
55660 KB |
Output is correct |
6 |
Correct |
172 ms |
59420 KB |
Output is correct |
7 |
Correct |
144 ms |
54080 KB |
Output is correct |
8 |
Correct |
118 ms |
50548 KB |
Output is correct |
9 |
Correct |
135 ms |
50688 KB |
Output is correct |
10 |
Correct |
167 ms |
54880 KB |
Output is correct |
11 |
Correct |
192 ms |
54876 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2078 ms |
49328 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
262 ms |
51272 KB |
Output is correct |
2 |
Execution timed out |
2090 ms |
51616 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
1 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
2 ms |
468 KB |
Output is correct |
7 |
Correct |
1 ms |
468 KB |
Output is correct |
8 |
Correct |
1 ms |
468 KB |
Output is correct |
9 |
Correct |
1 ms |
468 KB |
Output is correct |
10 |
Correct |
0 ms |
320 KB |
Output is correct |
11 |
Correct |
2 ms |
468 KB |
Output is correct |
12 |
Correct |
1 ms |
468 KB |
Output is correct |
13 |
Correct |
19 ms |
1236 KB |
Output is correct |
14 |
Correct |
14 ms |
1236 KB |
Output is correct |
15 |
Correct |
2 ms |
1236 KB |
Output is correct |
16 |
Correct |
6 ms |
1236 KB |
Output is correct |
17 |
Correct |
8 ms |
1364 KB |
Output is correct |
18 |
Correct |
5 ms |
1236 KB |
Output is correct |
19 |
Correct |
4 ms |
1236 KB |
Output is correct |
20 |
Correct |
6 ms |
1232 KB |
Output is correct |
21 |
Correct |
3 ms |
1236 KB |
Output is correct |
22 |
Correct |
5 ms |
1332 KB |
Output is correct |
23 |
Correct |
7 ms |
1232 KB |
Output is correct |
24 |
Correct |
5 ms |
1364 KB |
Output is correct |
25 |
Correct |
98 ms |
48744 KB |
Output is correct |
26 |
Correct |
97 ms |
49540 KB |
Output is correct |
27 |
Correct |
84 ms |
50856 KB |
Output is correct |
28 |
Correct |
62 ms |
49128 KB |
Output is correct |
29 |
Correct |
225 ms |
55660 KB |
Output is correct |
30 |
Correct |
172 ms |
59420 KB |
Output is correct |
31 |
Correct |
144 ms |
54080 KB |
Output is correct |
32 |
Correct |
118 ms |
50548 KB |
Output is correct |
33 |
Correct |
135 ms |
50688 KB |
Output is correct |
34 |
Correct |
167 ms |
54880 KB |
Output is correct |
35 |
Correct |
192 ms |
54876 KB |
Output is correct |
36 |
Execution timed out |
2078 ms |
49328 KB |
Time limit exceeded |
37 |
Halted |
0 ms |
0 KB |
- |