oj.uz

Submission #980906

# Submission time Handle Problem Language Result Execution time Memory
980906 2024-05-12T15:33:44 Z LOLOLO Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 709 ms 68292 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e5 + 10;
pair <int, int> seg[20][N * 4];
pair <int, int> laz[N * 4];
int n, k;

pair <int, int> merge(pair <int, int> A, pair <int, int> B) {
    return {min(A.f, B.f), max(A.s, B.s)};
}

void push(int id, int l, int r, int u, int v, int k) {
    if (l > v || r < u)
        return;

    if (l >= u && r <= v) {
        laz[id] = merge(laz[id], {k, k});
        return;
    }

    int m = (l + r) / 2;
    push(id * 2, l, m, u, v, k);
    push(id * 2 + 1, m + 1, r, u, v, k);
}

void run(int id, int l, int r, pair <int, int> st) {
    st = merge(st, laz[id]);
    if (l == r) {
        seg[0][id] = merge({l, l}, st);
        return;
    }

    int m = (l + r) / 2;
    run(id * 2, l, m, st);
    run(id * 2 + 1, m + 1, r, st);
    seg[0][id] = merge(seg[0][id * 2], seg[0][id * 2 + 1]);
}

pair <int, int> range(int dep, int id, int l, int r, int u, int v) {
    if (l > v || r < u)
        return {n + 1, 0};

    if (l >= u && r <= v) {
        return seg[dep][id];
    }

    int m = (l + r) / 2;
    return merge(range(dep, id * 2, l, m, u, v), range(dep, id * 2 + 1, m + 1, r, u, v));
}

void build(int dep, int id, int l, int r) {
    if (l == r) {
        pair <int, int> st = seg[dep - 1][id];
        st = range(dep - 1, 1, 1, n, st.f, st.s);
        seg[dep][id] = st;
        return;
    }

    int m = (l + r) / 2;
    build(dep, id * 2, l, m);
    build(dep, id * 2 + 1, m + 1, r);
    seg[dep][id] = merge(seg[dep][id * 2], seg[dep][id * 2 + 1]);
}

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

    cin >> n >> k; 

    for (int i = 1; i <= n * 4; i++) {
        laz[i].f = n + 1;
    }

    int m;
    cin >> m;

    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        if (x <= y) {
            push(1, 1, n, x, min(x + k - 1, y - 1), y);
        } else {
            push(1, 1, n, max(y + 1, x - k + 1), x, y);
        }
    }

    run(1, 1, n, {n + 1, 0});
    for (int i = 1; i < 20; i++) 
        build(i, 1, 1, n);

    int q;
    cin >> q;

    while (q--) {
        int s, t;
        cin >> s >> t;
        int ans = 0;
        pair <int, int> inv = {s, s};

        for (int j = 19; j >= 0; j--) {
            pair <int, int> sel = range(j, 1, 1, n, inv.f, inv.s);
            if (sel.f <= t && sel.s >= t)
                continue;

            ans |= (1 << j);
            inv = sel;
        }

        if (ans > m) {
            ans = -2;
        }

        cout << ans + 1 << '\n';
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 41308 KB Output is correct
2 Correct 6 ms 41308 KB Output is correct
3 Correct 6 ms 41308 KB Output is correct
4 Correct 6 ms 41464 KB Output is correct
5 Correct 7 ms 41436 KB Output is correct
6 Correct 5 ms 41308 KB Output is correct
7 Correct 6 ms 41308 KB Output is correct
8 Correct 5 ms 41308 KB Output is correct
9 Correct 5 ms 41376 KB Output is correct
10 Correct 5 ms 41308 KB Output is correct
11 Correct 7 ms 41476 KB Output is correct
12 Correct 6 ms 41308 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 41308 KB Output is correct
2 Correct 6 ms 41308 KB Output is correct
3 Correct 6 ms 41308 KB Output is correct
4 Correct 6 ms 41464 KB Output is correct
5 Correct 7 ms 41436 KB Output is correct
6 Correct 5 ms 41308 KB Output is correct
7 Correct 6 ms 41308 KB Output is correct
8 Correct 5 ms 41308 KB Output is correct
9 Correct 5 ms 41376 KB Output is correct
10 Correct 5 ms 41308 KB Output is correct
11 Correct 7 ms 41476 KB Output is correct
12 Correct 6 ms 41308 KB Output is correct
13 Correct 13 ms 41564 KB Output is correct
14 Correct 13 ms 41564 KB Output is correct
15 Correct 9 ms 41564 KB Output is correct
16 Correct 9 ms 41564 KB Output is correct
17 Correct 13 ms 41564 KB Output is correct
18 Correct 9 ms 41564 KB Output is correct
19 Correct 11 ms 41564 KB Output is correct
20 Correct 10 ms 41544 KB Output is correct
21 Correct 6 ms 41564 KB Output is correct
22 Correct 12 ms 41552 KB Output is correct
23 Correct 12 ms 41588 KB Output is correct
24 Correct 13 ms 41564 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 410 ms 66108 KB Output is correct
2 Correct 357 ms 65876 KB Output is correct
3 Correct 413 ms 66032 KB Output is correct
4 Correct 353 ms 65836 KB Output is correct
5 Correct 115 ms 67204 KB Output is correct
6 Correct 345 ms 67412 KB Output is correct
7 Correct 94 ms 67060 KB Output is correct
8 Correct 73 ms 66152 KB Output is correct
9 Correct 72 ms 66132 KB Output is correct
10 Correct 337 ms 67192 KB Output is correct
11 Correct 289 ms 67500 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 492 ms 66608 KB Output is correct
2 Correct 446 ms 68128 KB Output is correct
3 Correct 646 ms 67004 KB Output is correct
4 Correct 225 ms 67580 KB Output is correct
5 Correct 220 ms 67816 KB Output is correct
6 Correct 216 ms 67924 KB Output is correct
7 Correct 540 ms 68052 KB Output is correct
8 Correct 435 ms 67924 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 68040 KB Output is correct
2 Correct 702 ms 67420 KB Output is correct
3 Correct 672 ms 66500 KB Output is correct
4 Correct 674 ms 66132 KB Output is correct
5 Correct 520 ms 65748 KB Output is correct
6 Correct 558 ms 65756 KB Output is correct
7 Correct 409 ms 66932 KB Output is correct
8 Correct 5 ms 41308 KB Output is correct
9 Correct 11 ms 41564 KB Output is correct
10 Correct 321 ms 67188 KB Output is correct
11 Correct 445 ms 68292 KB Output is correct
12 Correct 468 ms 67760 KB Output is correct
13 Correct 443 ms 67792 KB Output is correct
14 Correct 5 ms 41308 KB Output is correct
15 Correct 13 ms 41564 KB Output is correct
16 Correct 393 ms 67296 KB Output is correct
17 Correct 628 ms 68184 KB Output is correct
18 Correct 608 ms 67932 KB Output is correct
19 Correct 563 ms 68008 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 41308 KB Output is correct
2 Correct 6 ms 41308 KB Output is correct
3 Correct 6 ms 41308 KB Output is correct
4 Correct 6 ms 41464 KB Output is correct
5 Correct 7 ms 41436 KB Output is correct
6 Correct 5 ms 41308 KB Output is correct
7 Correct 6 ms 41308 KB Output is correct
8 Correct 5 ms 41308 KB Output is correct
9 Correct 5 ms 41376 KB Output is correct
10 Correct 5 ms 41308 KB Output is correct
11 Correct 7 ms 41476 KB Output is correct
12 Correct 6 ms 41308 KB Output is correct
13 Correct 13 ms 41564 KB Output is correct
14 Correct 13 ms 41564 KB Output is correct
15 Correct 9 ms 41564 KB Output is correct
16 Correct 9 ms 41564 KB Output is correct
17 Correct 13 ms 41564 KB Output is correct
18 Correct 9 ms 41564 KB Output is correct
19 Correct 11 ms 41564 KB Output is correct
20 Correct 10 ms 41544 KB Output is correct
21 Correct 6 ms 41564 KB Output is correct
22 Correct 12 ms 41552 KB Output is correct
23 Correct 12 ms 41588 KB Output is correct
24 Correct 13 ms 41564 KB Output is correct
25 Correct 410 ms 66108 KB Output is correct
26 Correct 357 ms 65876 KB Output is correct
27 Correct 413 ms 66032 KB Output is correct
28 Correct 353 ms 65836 KB Output is correct
29 Correct 115 ms 67204 KB Output is correct
30 Correct 345 ms 67412 KB Output is correct
31 Correct 94 ms 67060 KB Output is correct
32 Correct 73 ms 66152 KB Output is correct
33 Correct 72 ms 66132 KB Output is correct
34 Correct 337 ms 67192 KB Output is correct
35 Correct 289 ms 67500 KB Output is correct
36 Correct 492 ms 66608 KB Output is correct
37 Correct 446 ms 68128 KB Output is correct
38 Correct 646 ms 67004 KB Output is correct
39 Correct 225 ms 67580 KB Output is correct
40 Correct 220 ms 67816 KB Output is correct
41 Correct 216 ms 67924 KB Output is correct
42 Correct 540 ms 68052 KB Output is correct
43 Correct 435 ms 67924 KB Output is correct
44 Correct 499 ms 68040 KB Output is correct
45 Correct 702 ms 67420 KB Output is correct
46 Correct 672 ms 66500 KB Output is correct
47 Correct 674 ms 66132 KB Output is correct
48 Correct 520 ms 65748 KB Output is correct
49 Correct 558 ms 65756 KB Output is correct
50 Correct 409 ms 66932 KB Output is correct
51 Correct 5 ms 41308 KB Output is correct
52 Correct 11 ms 41564 KB Output is correct
53 Correct 321 ms 67188 KB Output is correct
54 Correct 445 ms 68292 KB Output is correct
55 Correct 468 ms 67760 KB Output is correct
56 Correct 443 ms 67792 KB Output is correct
57 Correct 5 ms 41308 KB Output is correct
58 Correct 13 ms 41564 KB Output is correct
59 Correct 393 ms 67296 KB Output is correct
60 Correct 628 ms 68184 KB Output is correct
61 Correct 608 ms 67932 KB Output is correct
62 Correct 563 ms 68008 KB Output is correct
63 Correct 625 ms 67092 KB Output is correct
64 Correct 709 ms 66976 KB Output is correct
65 Correct 596 ms 66740 KB Output is correct
66 Correct 141 ms 67924 KB Output is correct
67 Correct 563 ms 68008 KB Output is correct
68 Correct 463 ms 68228 KB Output is correct
69 Correct 226 ms 67952 KB Output is correct
70 Correct 624 ms 67964 KB Output is correct
71 Correct 655 ms 68184 KB Output is correct