oj.uz

Submission #631227

# Submission time Handle Problem Language Result Execution time Memory
631227 2022-08-17T21:07:21 Z Ooops_sorry Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 898 ms 93088 KB 
#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, K = 300;

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), up_l_block(n), up_r_block(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);
    for (int i = 0; i < n; i++) {
        pair<int,int> seg{i, i}, new_seg;
        for (int j = 0; j < K; j++) {
            new_seg = {min(seg.first, L.get_min(seg.first, seg.second)), max(seg.second, R.get_max(seg.first, seg.second))};
            swap(seg, new_seg);
        }
        up_l_block[i] = seg.first;
        up_r_block[i] = seg.second;
    }
    SparseTable L_block(up_l_block), R_block(up_r_block);
    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}, new_seg;
        int ans = 0;
        while (!(seg.first <= t && t <= seg.second)) {
            new_seg = {min(seg.first, L_block.get_min(seg.first, seg.second)), max(seg.second, R_block.get_max(seg.first, seg.second))};
            if (seg == new_seg) {
                ans = -1;
                break;
            }
            if (new_seg.first <= t && t <= new_seg.second) {
                while (!(seg.first <= t && t <= seg.second)) {
                    new_seg = {min(seg.first, L.get_min(seg.first, seg.second)), max(seg.second, R.get_max(seg.first, seg.second))};
                    ans++;
                    swap(seg, new_seg);
                }
                break;
            }
            ans += K;
            swap(seg, new_seg);
        }
        cout << ans << endl;
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 14 ms 1968 KB Output is correct
14 Correct 12 ms 1876 KB Output is correct
15 Correct 8 ms 1940 KB Output is correct
16 Correct 11 ms 1972 KB Output is correct
17 Correct 13 ms 1876 KB Output is correct
18 Correct 11 ms 1876 KB Output is correct
19 Correct 11 ms 1876 KB Output is correct
20 Correct 12 ms 1952 KB Output is correct
21 Correct 8 ms 1876 KB Output is correct
22 Correct 11 ms 1952 KB Output is correct
23 Correct 11 ms 1876 KB Output is correct
24 Correct 12 ms 2004 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 81568 KB Output is correct
2 Correct 399 ms 81432 KB Output is correct
3 Correct 395 ms 82620 KB Output is correct
4 Correct 385 ms 81060 KB Output is correct
5 Correct 517 ms 86236 KB Output is correct
6 Correct 477 ms 89916 KB Output is correct
7 Correct 457 ms 85012 KB Output is correct
8 Correct 424 ms 81936 KB Output is correct
9 Correct 435 ms 82568 KB Output is correct
10 Correct 642 ms 85400 KB Output is correct
11 Correct 535 ms 85492 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 618 ms 82364 KB Output is correct
2 Correct 621 ms 88724 KB Output is correct
3 Correct 629 ms 84788 KB Output is correct
4 Correct 557 ms 87608 KB Output is correct
5 Correct 607 ms 88360 KB Output is correct
6 Correct 606 ms 88968 KB Output is correct
7 Correct 648 ms 88532 KB Output is correct
8 Correct 787 ms 88460 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 84060 KB Output is correct
2 Correct 711 ms 83552 KB Output is correct
3 Correct 597 ms 80844 KB Output is correct
4 Correct 558 ms 78248 KB Output is correct
5 Correct 525 ms 76992 KB Output is correct
6 Correct 516 ms 76600 KB Output is correct
7 Correct 462 ms 82212 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 11 ms 1876 KB Output is correct
10 Correct 508 ms 86252 KB Output is correct
11 Correct 551 ms 87056 KB Output is correct
12 Correct 567 ms 85720 KB Output is correct
13 Correct 563 ms 86676 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 13 ms 1976 KB Output is correct
16 Correct 453 ms 85392 KB Output is correct
17 Correct 659 ms 86292 KB Output is correct
18 Correct 647 ms 86228 KB Output is correct
19 Correct 670 ms 86220 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 14 ms 1968 KB Output is correct
14 Correct 12 ms 1876 KB Output is correct
15 Correct 8 ms 1940 KB Output is correct
16 Correct 11 ms 1972 KB Output is correct
17 Correct 13 ms 1876 KB Output is correct
18 Correct 11 ms 1876 KB Output is correct
19 Correct 11 ms 1876 KB Output is correct
20 Correct 12 ms 1952 KB Output is correct
21 Correct 8 ms 1876 KB Output is correct
22 Correct 11 ms 1952 KB Output is correct
23 Correct 11 ms 1876 KB Output is correct
24 Correct 12 ms 2004 KB Output is correct
25 Correct 381 ms 81568 KB Output is correct
26 Correct 399 ms 81432 KB Output is correct
27 Correct 395 ms 82620 KB Output is correct
28 Correct 385 ms 81060 KB Output is correct
29 Correct 517 ms 86236 KB Output is correct
30 Correct 477 ms 89916 KB Output is correct
31 Correct 457 ms 85012 KB Output is correct
32 Correct 424 ms 81936 KB Output is correct
33 Correct 435 ms 82568 KB Output is correct
34 Correct 642 ms 85400 KB Output is correct
35 Correct 535 ms 85492 KB Output is correct
36 Correct 618 ms 82364 KB Output is correct
37 Correct 621 ms 88724 KB Output is correct
38 Correct 629 ms 84788 KB Output is correct
39 Correct 557 ms 87608 KB Output is correct
40 Correct 607 ms 88360 KB Output is correct
41 Correct 606 ms 88968 KB Output is correct
42 Correct 648 ms 88532 KB Output is correct
43 Correct 787 ms 88460 KB Output is correct
44 Correct 563 ms 84060 KB Output is correct
45 Correct 711 ms 83552 KB Output is correct
46 Correct 597 ms 80844 KB Output is correct
47 Correct 558 ms 78248 KB Output is correct
48 Correct 525 ms 76992 KB Output is correct
49 Correct 516 ms 76600 KB Output is correct
50 Correct 462 ms 82212 KB Output is correct
51 Correct 3 ms 468 KB Output is correct
52 Correct 11 ms 1876 KB Output is correct
53 Correct 508 ms 86252 KB Output is correct
54 Correct 551 ms 87056 KB Output is correct
55 Correct 567 ms 85720 KB Output is correct
56 Correct 563 ms 86676 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 13 ms 1976 KB Output is correct
59 Correct 453 ms 85392 KB Output is correct
60 Correct 659 ms 86292 KB Output is correct
61 Correct 647 ms 86228 KB Output is correct
62 Correct 670 ms 86220 KB Output is correct
63 Correct 606 ms 82600 KB Output is correct
64 Correct 639 ms 84040 KB Output is correct
65 Correct 621 ms 82920 KB Output is correct
66 Correct 593 ms 89508 KB Output is correct
67 Correct 751 ms 93088 KB Output is correct
68 Correct 595 ms 87364 KB Output is correct
69 Correct 661 ms 88788 KB Output is correct
70 Correct 625 ms 88548 KB Output is correct
71 Correct 898 ms 88552 KB Output is correct