oj.uz

Submission #895386

# Submission time Handle Problem Language Result Execution time Memory
895386 2023-12-29T20:37:44 Z juliany2 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 176 ms 37716 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()

template<class T> struct ST {
    static constexpr T ID = {{{(int) 1e9, 0}, {(int) -1e9, 0}}}; // or whatever ID
    inline T comb(T a, T b) { return {min(a[0], b[0]), max(a[1], b[1])}; } // or whatever function

    int sz;
    vector<T> t;

    void init(int _sz, T val = ID) {
        t.assign((sz = _sz) * 2, ID);
    }
    void init(vector<T> &v) {
        t.resize((sz = v.size()) * 2);
        for (int i = 0; i < sz; ++i)
            t[i + sz] = v[i];
        for (int i = sz - 1; i; --i)
            t[i] = comb(t[i * 2], t[(i * 2) | 1]);
    }
    void upd(int i, T x) {
        for (t[i += sz] = x; i > 1; i >>= 1)
            t[i >> 1] = comb(t[i], t[i ^ 1]);
    }
    T query(int l, int r) {
        T ql = ID, qr = ID;
        for (l += sz, r += sz + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) ql = comb(ql, t[l++]);
            if (r & 1) qr = comb(t[--r], qr);
        }
        return comb(ql, qr);
    }
};

const int N = 1e5 + 7, L = 20;
int n, k, m;
int l[N], r[N];
int lift[N][L][2];
vector<int> x[N], y[N];

int bmin(int a, int b) {
    return l[a] < l[b] ? a : b;
}

int bmax(int a, int b) {
    return r[a] > r[b] ? a : b;

}

int main() {
    cin.tie(0)->sync_with_stdio(false);

    cin >> n >> k >> m;

    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;

        if (a < b) {
            int s = min(b, a + k - 1);
            x[a].push_back(b);
            x[s + 1].push_back(-b);
        }
        else {
            int s = max(b, a - k + 1);
            y[s].push_back(b);
            y[a + 1].push_back(-b);
        }
    }

    iota(l + 1, l + n + 1, 1);
    iota(r + 1, r + n + 1, 1);

    ST<array<array<int, 2>, 2>> st;
    st.init(n + 1);

    multiset<int> X, Y;
    for (int i = 1; i <= n; i++) {
        for (int a : x[i]) {
            if (a > 0)
                X.insert(a);
            else
                X.erase(X.find(-a));
        }
        for (int a : y[i]) {
            if (a > 0)
                Y.insert(a);
            else
                Y.erase(Y.find(-a));
        }

        if (X.size())
            r[i] = *X.rbegin();
        if (Y.size())
            l[i] = *Y.begin();

        st.upd(i, {{{l[i], i}, {r[i], i}}});
    }

    for (int i = 1; i <= n; i++) {
        lift[i][0][0] = st.query(l[i], r[i])[0][1];
        lift[i][0][1] = st.query(l[i], r[i])[1][1];
    }

    for (int j = 1; j < L; j++) {
        for (int i = 1; i <= n; i++) {
            lift[i][j][0] = bmin(lift[lift[i][j - 1][0]][j - 1][0], lift[lift[i][j - 1][1]][j - 1][0]);
            lift[i][j][1] = bmax(lift[lift[i][j - 1][0]][j - 1][1], lift[lift[i][j - 1][1]][j - 1][1]);
        }
    }

    int q;
    cin >> q;

    while (q--) {
        int s, t;
        cin >> s >> t;

        if (t >= l[s] && t <= r[s]) {
            cout << 1 << '\n';
            continue;
        }

        int a = s, b = s, ans = 1;
        for (int i = L - 1; ~i; i--) {
            int na = bmin(lift[a][i][0], lift[b][i][0]), nb = bmax(lift[a][i][1], lift[b][i][1]);
            if (t < l[na] || t > r[nb])
                a = na, b = nb, ans += (1 << i);
        }

        int fa = bmin(lift[a][0][0], lift[b][0][0]), fb = bmax(lift[a][0][1], lift[b][0][1]);

        cout << (t >= l[fa] && t <= r[fb] ? ans + 1 : -1) << '\n';
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 2 ms 8812 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8792 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 2 ms 8812 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8792 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 3 ms 8792 KB Output is correct
14 Correct 4 ms 8796 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 4 ms 9052 KB Output is correct
17 Correct 3 ms 8856 KB Output is correct
18 Correct 3 ms 9052 KB Output is correct
19 Correct 3 ms 9052 KB Output is correct
20 Correct 3 ms 9052 KB Output is correct
21 Correct 4 ms 9064 KB Output is correct
22 Correct 3 ms 9052 KB Output is correct
23 Correct 4 ms 8796 KB Output is correct
24 Correct 3 ms 8796 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 27632 KB Output is correct
2 Correct 59 ms 27476 KB Output is correct
3 Correct 81 ms 27732 KB Output is correct
4 Correct 55 ms 27480 KB Output is correct
5 Correct 168 ms 32596 KB Output is correct
6 Correct 84 ms 30956 KB Output is correct
7 Correct 110 ms 36428 KB Output is correct
8 Correct 99 ms 30544 KB Output is correct
9 Correct 97 ms 31000 KB Output is correct
10 Correct 107 ms 30316 KB Output is correct
11 Correct 108 ms 30292 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 32116 KB Output is correct
2 Correct 164 ms 32720 KB Output is correct
3 Correct 88 ms 31228 KB Output is correct
4 Correct 142 ms 36416 KB Output is correct
5 Correct 172 ms 35408 KB Output is correct
6 Correct 157 ms 34896 KB Output is correct
7 Correct 118 ms 30340 KB Output is correct
8 Correct 132 ms 30548 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 31148 KB Output is correct
2 Correct 97 ms 28080 KB Output is correct
3 Correct 66 ms 26456 KB Output is correct
4 Correct 58 ms 25516 KB Output is correct
5 Correct 55 ms 25212 KB Output is correct
6 Correct 51 ms 25024 KB Output is correct
7 Correct 88 ms 32956 KB Output is correct
8 Correct 2 ms 8792 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 176 ms 32124 KB Output is correct
11 Correct 159 ms 33620 KB Output is correct
12 Correct 171 ms 31572 KB Output is correct
13 Correct 153 ms 33616 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 3 ms 8796 KB Output is correct
16 Correct 90 ms 28700 KB Output is correct
17 Correct 117 ms 29008 KB Output is correct
18 Correct 119 ms 29012 KB Output is correct
19 Correct 125 ms 29140 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 2 ms 8812 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8792 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 3 ms 8792 KB Output is correct
14 Correct 4 ms 8796 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 4 ms 9052 KB Output is correct
17 Correct 3 ms 8856 KB Output is correct
18 Correct 3 ms 9052 KB Output is correct
19 Correct 3 ms 9052 KB Output is correct
20 Correct 3 ms 9052 KB Output is correct
21 Correct 4 ms 9064 KB Output is correct
22 Correct 3 ms 9052 KB Output is correct
23 Correct 4 ms 8796 KB Output is correct
24 Correct 3 ms 8796 KB Output is correct
25 Correct 77 ms 27632 KB Output is correct
26 Correct 59 ms 27476 KB Output is correct
27 Correct 81 ms 27732 KB Output is correct
28 Correct 55 ms 27480 KB Output is correct
29 Correct 168 ms 32596 KB Output is correct
30 Correct 84 ms 30956 KB Output is correct
31 Correct 110 ms 36428 KB Output is correct
32 Correct 99 ms 30544 KB Output is correct
33 Correct 97 ms 31000 KB Output is correct
34 Correct 107 ms 30316 KB Output is correct
35 Correct 108 ms 30292 KB Output is correct
36 Correct 83 ms 32116 KB Output is correct
37 Correct 164 ms 32720 KB Output is correct
38 Correct 88 ms 31228 KB Output is correct
39 Correct 142 ms 36416 KB Output is correct
40 Correct 172 ms 35408 KB Output is correct
41 Correct 157 ms 34896 KB Output is correct
42 Correct 118 ms 30340 KB Output is correct
43 Correct 132 ms 30548 KB Output is correct
44 Correct 166 ms 31148 KB Output is correct
45 Correct 97 ms 28080 KB Output is correct
46 Correct 66 ms 26456 KB Output is correct
47 Correct 58 ms 25516 KB Output is correct
48 Correct 55 ms 25212 KB Output is correct
49 Correct 51 ms 25024 KB Output is correct
50 Correct 88 ms 32956 KB Output is correct
51 Correct 2 ms 8792 KB Output is correct
52 Correct 3 ms 8796 KB Output is correct
53 Correct 176 ms 32124 KB Output is correct
54 Correct 159 ms 33620 KB Output is correct
55 Correct 171 ms 31572 KB Output is correct
56 Correct 153 ms 33616 KB Output is correct
57 Correct 2 ms 8796 KB Output is correct
58 Correct 3 ms 8796 KB Output is correct
59 Correct 90 ms 28700 KB Output is correct
60 Correct 117 ms 29008 KB Output is correct
61 Correct 119 ms 29012 KB Output is correct
62 Correct 125 ms 29140 KB Output is correct
63 Correct 87 ms 29008 KB Output is correct
64 Correct 90 ms 29520 KB Output is correct
65 Correct 88 ms 29264 KB Output is correct
66 Correct 158 ms 35668 KB Output is correct
67 Correct 116 ms 34064 KB Output is correct
68 Correct 149 ms 33364 KB Output is correct
69 Correct 162 ms 37716 KB Output is correct
70 Correct 134 ms 33304 KB Output is correct
71 Correct 132 ms 33356 KB Output is correct