oj.uz

답안 #594092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594092 2022-07-12T05:18:56 Z piOOE Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 332 ms 231944 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 = 18;
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 5 ms 3284 KB Output is correct
14 Correct 3 ms 3284 KB Output is correct
15 Correct 3 ms 3284 KB Output is correct
16 Correct 4 ms 3284 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 5 ms 3412 KB Output is correct
19 Correct 4 ms 3156 KB Output is correct
20 Correct 5 ms 3304 KB Output is correct
21 Correct 3 ms 3284 KB Output is correct
22 Correct 5 ms 3328 KB Output is correct
23 Correct 4 ms 3324 KB Output is correct
24 Correct 3 ms 3284 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 229112 KB Output is correct
2 Correct 173 ms 229064 KB Output is correct
3 Correct 199 ms 229380 KB Output is correct
4 Correct 173 ms 228916 KB Output is correct
5 Correct 256 ms 230880 KB Output is correct
6 Correct 252 ms 230268 KB Output is correct
7 Correct 235 ms 231416 KB Output is correct
8 Correct 234 ms 227068 KB Output is correct
9 Correct 235 ms 229372 KB Output is correct
10 Correct 224 ms 230436 KB Output is correct
11 Correct 213 ms 230392 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 293 ms 228980 KB Output is correct
2 Correct 262 ms 230924 KB Output is correct
3 Correct 228 ms 229700 KB Output is correct
4 Correct 291 ms 231484 KB Output is correct
5 Correct 267 ms 228840 KB Output is correct
6 Correct 295 ms 231100 KB Output is correct
7 Correct 290 ms 230596 KB Output is correct
8 Correct 272 ms 230648 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 325 ms 231876 KB Output is correct
2 Correct 286 ms 229716 KB Output is correct
3 Correct 270 ms 227908 KB Output is correct
4 Correct 236 ms 226576 KB Output is correct
5 Correct 193 ms 226252 KB Output is correct
6 Correct 202 ms 225784 KB Output is correct
7 Correct 266 ms 229988 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 3 ms 3284 KB Output is correct
10 Correct 283 ms 231944 KB Output is correct
11 Correct 302 ms 231876 KB Output is correct
12 Correct 286 ms 229368 KB Output is correct
13 Correct 313 ms 231548 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 5 ms 3284 KB Output is correct
16 Correct 218 ms 231452 KB Output is correct
17 Correct 332 ms 231584 KB Output is correct
18 Correct 310 ms 231544 KB Output is correct
19 Correct 253 ms 231560 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 5 ms 3284 KB Output is correct
14 Correct 3 ms 3284 KB Output is correct
15 Correct 3 ms 3284 KB Output is correct
16 Correct 4 ms 3284 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 5 ms 3412 KB Output is correct
19 Correct 4 ms 3156 KB Output is correct
20 Correct 5 ms 3304 KB Output is correct
21 Correct 3 ms 3284 KB Output is correct
22 Correct 5 ms 3328 KB Output is correct
23 Correct 4 ms 3324 KB Output is correct
24 Correct 3 ms 3284 KB Output is correct
25 Correct 234 ms 229112 KB Output is correct
26 Correct 173 ms 229064 KB Output is correct
27 Correct 199 ms 229380 KB Output is correct
28 Correct 173 ms 228916 KB Output is correct
29 Correct 256 ms 230880 KB Output is correct
30 Correct 252 ms 230268 KB Output is correct
31 Correct 235 ms 231416 KB Output is correct
32 Correct 234 ms 227068 KB Output is correct
33 Correct 235 ms 229372 KB Output is correct
34 Correct 224 ms 230436 KB Output is correct
35 Correct 213 ms 230392 KB Output is correct
36 Correct 293 ms 228980 KB Output is correct
37 Correct 262 ms 230924 KB Output is correct
38 Correct 228 ms 229700 KB Output is correct
39 Correct 291 ms 231484 KB Output is correct
40 Correct 267 ms 228840 KB Output is correct
41 Correct 295 ms 231100 KB Output is correct
42 Correct 290 ms 230596 KB Output is correct
43 Correct 272 ms 230648 KB Output is correct
44 Correct 325 ms 231876 KB Output is correct
45 Correct 286 ms 229716 KB Output is correct
46 Correct 270 ms 227908 KB Output is correct
47 Correct 236 ms 226576 KB Output is correct
48 Correct 193 ms 226252 KB Output is correct
49 Correct 202 ms 225784 KB Output is correct
50 Correct 266 ms 229988 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 3 ms 3284 KB Output is correct
53 Correct 283 ms 231944 KB Output is correct
54 Correct 302 ms 231876 KB Output is correct
55 Correct 286 ms 229368 KB Output is correct
56 Correct 313 ms 231548 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 5 ms 3284 KB Output is correct
59 Correct 218 ms 231452 KB Output is correct
60 Correct 332 ms 231584 KB Output is correct
61 Correct 310 ms 231544 KB Output is correct
62 Correct 253 ms 231560 KB Output is correct
63 Correct 231 ms 229192 KB Output is correct
64 Correct 237 ms 229532 KB Output is correct
65 Correct 252 ms 229292 KB Output is correct
66 Correct 263 ms 231268 KB Output is correct
67 Correct 262 ms 230528 KB Output is correct
68 Correct 288 ms 228692 KB Output is correct
69 Correct 275 ms 231136 KB Output is correct
70 Correct 248 ms 230536 KB Output is correct
71 Correct 304 ms 230564 KB Output is correct