oj.uz

Submission #594091

# Submission time Handle Problem Language Result Execution time Memory
594091 2022-07-12T05:18:23 Z piOOE Railway Trip 2 (JOI22_ho_t4) C++17
52 / 100
 327 ms 218944 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

template<typename T>
struct SparseTableMax { //max
    int n;
    vector<vector<T>> st;

    SparseTableMax(const vector<T> &a) {
        init(a);
    }

    void init(const vector<T>& a) {
        n = static_cast<int>(a.size());
        int max_log = 32 - __builtin_clz(n);
        st.resize(max_log);
        st[0] = a;
        for (int j = 1; j < max_log; ++j) {
            st[j].resize(n - (1 << j) + 1);
            for (int i = 0; i <= n - (1 << j); ++i) {
                st[j][i] = max(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
            }
        }
    }

    SparseTableMax() = default;

    T get(int L, int R) const {
        assert(0 <= L && L < R && R <= n);
        int lg = __lg(R - L);
        return max(st[lg][L], st[lg][R - (1 << lg)]);
    }
};

template <typename T>
struct SparseTableMin { //min
    int n;
    vector<vector<T>> st;

    SparseTableMin(const vector<T>& a) {
        init(a);
    }

    void init(const vector<T>& a) {
        n = static_cast<int>(a.size());
        int max_log = 32 - __builtin_clz(n);
        st.resize(max_log);
        st[0] = a;
        for (int j = 1; j < max_log; ++j) {
            st[j].resize(n - (1 << j) + 1);
            for (int i = 0; i <= n - (1 << j); ++i) {
                st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
            }
        }
    }

    SparseTableMin() = default;

    T get(int L, int R) const {
        assert(0 <= L && L < R && R <= n);
        int lg = __lg(R - L);
        return min(st[lg][L], st[lg][R - (1 << lg)]);
    }
};
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, k, m;
    cin >> n >> k >> m;
    vector<vector<int>> qu(n);
    vector<pair<int, int>> b(m);
    for (int i = 0; i < m; ++i) {
        cin >> b[i].first >> b[i].second;
        --b[i].first, --b[i].second;
    }
    //from left to right
    for (int i = 0; i < m; ++i) {
        if (b[i].first < b[i].second) {
            qu[b[i].first].push_back(b[i].second);
            int r = min(b[i].first + k, b[i].second);
            qu[r].push_back(~b[i].second);
        }
    }
    int logn = 17;
    vector<vector<int>> R(logn, vector<int>(n)), L(logn, vector<int>(n));
    multiset<int, greater<>> st1;
    for (int i = 0; i < n; ++i) {
        for (int r : qu[i]) {
            if (r >= 0) {
                st1.insert(r);
            } else {
                st1.extract(~r);
            }
        }
        qu[i].clear();
        if (st1.empty()) {
            R[0][i] = i;
        } else {
            R[0][i] = *st1.begin();
        }
    }
    //from right to left
    for (int i = 0; i < m; ++i) {
        if (b[i].first > b[i].second) {
            qu[b[i].first].push_back(b[i].second);
            int l = max(b[i].second, b[i].first - k);
            qu[l].push_back(~b[i].second);
        }
    }
    multiset<int> st2;
    for (int i = n - 1; i > -1; --i) {
        for (int l : qu[i]) {
            if (l >= 0) {
                st2.insert(l);
            } else {
                st2.extract(~l);
            }
        }
        qu[i].clear();
        if (st2.empty()) {
            L[0][i] = i;
        } else {
            L[0][i] = *st2.begin();
        }
    }
    //calc binups
    SparseTableMax<int> stR[logn];
    SparseTableMin<int> stL[logn];
    for (int j = 1; j < logn; ++j) {
        stR[j - 1].init(R[j - 1]);
        stL[j - 1].init(L[j - 1]);
        for (int i = 0; i < n; ++i) {
            L[j][i] = stL[j - 1].get(L[j - 1][i], R[j - 1][i] + 1);
            R[j][i] = stR[j - 1].get(L[j - 1][i], R[j - 1][i] + 1);
        }
    }
    int q;
    cin >> q;
    while (q--) {
        int s, t;
        cin >> s >> t;
        --s, --t;
        if (s < t) {
            if (R[logn - 1][s] < t) {
                cout << "-1\n";
                continue;
            }
            int ans = 0;
            int l = s, r = s;
            for (int j = logn - 1; j > -1; --j) {
                if (R[j][s] < t) {
                    ans += 1 << j;
                    r = R[j][s];
                    l = L[j][s];
                    break;
                }
            }
            for (int j = logn - 2; j > -1; --j) {
                if (stR[j].get(l, r + 1) < t) {
                    int rr = stR[j].get(l, r + 1);
                    int ll = stL[j].get(l, r + 1);
                    r = rr, l = ll;
                    ans += 1 << j;
                }
            }
            cout << ans + 1 << '\n';
        } else {
            if (L[logn - 1][s] > t) {
                cout << "-1\n";
                continue;
            }
            int ans = 0;
            int l = s, r = s;
            for (int j = logn - 1; j > -1; --j) {
                if (L[j][s] > t) {
                    ans += 1 << j;
                    r = R[j][s];
                    l = L[j][s];
                    break;
                }
            }
            for (int j = logn - 2; j > -1; --j) {
                if (stL[j].get(l, r + 1) > t) {
                    int rr = stR[j].get(l, r + 1);
                    int ll = stL[j].get(l, r + 1);
                    r = rr, l = ll;
                    ans += 1 << j;
                }
            }
            cout << ans + 1 << '\n';
        }
    }
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 4 ms 3156 KB Output is correct
14 Correct 4 ms 3156 KB Output is correct
15 Correct 3 ms 3156 KB Output is correct
16 Correct 4 ms 3156 KB Output is correct
17 Correct 6 ms 3228 KB Output is correct
18 Correct 4 ms 3236 KB Output is correct
19 Correct 4 ms 3028 KB Output is correct
20 Correct 4 ms 3140 KB Output is correct
21 Correct 4 ms 3204 KB Output is correct
22 Correct 4 ms 3156 KB Output is correct
23 Correct 3 ms 3156 KB Output is correct
24 Correct 3 ms 3156 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 215988 KB Output is correct
2 Correct 168 ms 216140 KB Output is correct
3 Correct 184 ms 216360 KB Output is correct
4 Correct 158 ms 215856 KB Output is correct
5 Correct 256 ms 217972 KB Output is correct
6 Correct 238 ms 217156 KB Output is correct
7 Correct 225 ms 218356 KB Output is correct
8 Correct 220 ms 214184 KB Output is correct
9 Correct 208 ms 216292 KB Output is correct
10 Correct 215 ms 217352 KB Output is correct
11 Correct 239 ms 217476 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 216004 KB Output is correct
2 Correct 275 ms 217952 KB Output is correct
3 Correct 251 ms 216644 KB Output is correct
4 Correct 253 ms 218360 KB Output is correct
5 Correct 301 ms 215780 KB Output is correct
6 Correct 266 ms 217984 KB Output is correct
7 Correct 240 ms 217412 KB Output is correct
8 Correct 270 ms 217596 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 218944 KB Output is correct
2 Incorrect 257 ms 216684 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 4 ms 3156 KB Output is correct
14 Correct 4 ms 3156 KB Output is correct
15 Correct 3 ms 3156 KB Output is correct
16 Correct 4 ms 3156 KB Output is correct
17 Correct 6 ms 3228 KB Output is correct
18 Correct 4 ms 3236 KB Output is correct
19 Correct 4 ms 3028 KB Output is correct
20 Correct 4 ms 3140 KB Output is correct
21 Correct 4 ms 3204 KB Output is correct
22 Correct 4 ms 3156 KB Output is correct
23 Correct 3 ms 3156 KB Output is correct
24 Correct 3 ms 3156 KB Output is correct
25 Correct 160 ms 215988 KB Output is correct
26 Correct 168 ms 216140 KB Output is correct
27 Correct 184 ms 216360 KB Output is correct
28 Correct 158 ms 215856 KB Output is correct
29 Correct 256 ms 217972 KB Output is correct
30 Correct 238 ms 217156 KB Output is correct
31 Correct 225 ms 218356 KB Output is correct
32 Correct 220 ms 214184 KB Output is correct
33 Correct 208 ms 216292 KB Output is correct
34 Correct 215 ms 217352 KB Output is correct
35 Correct 239 ms 217476 KB Output is correct
36 Correct 227 ms 216004 KB Output is correct
37 Correct 275 ms 217952 KB Output is correct
38 Correct 251 ms 216644 KB Output is correct
39 Correct 253 ms 218360 KB Output is correct
40 Correct 301 ms 215780 KB Output is correct
41 Correct 266 ms 217984 KB Output is correct
42 Correct 240 ms 217412 KB Output is correct
43 Correct 270 ms 217596 KB Output is correct
44 Correct 327 ms 218944 KB Output is correct
45 Incorrect 257 ms 216684 KB Output isn't correct
46 Halted 0 ms 0 KB -