oj.uz

Submission #766053

# Submission time Handle Problem Language Result Execution time Memory
766053 2023-06-25T09:29:37 Z sysia Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 834 ms 97776 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 20;
const int mod = 998244353;

struct TreeMin{
    vector<int>tab;
    int size = 1;

    void init(int n){
        while (size < n) size*=2;
        tab.assign(2*size, oo);
    }

    void update(int x, int v){
        x += size;
        tab[x] = min(tab[x], v);
        while (x){
            x/=2;
            tab[x] = min(tab[2*x], tab[2*x+1]);
        }
    }

    int query(int l, int r){
        int ans = oo;
        for (l += size-1, r += size+1; r-l>1; l/=2, r/=2){
            if (!(l&1)) ans = min(ans, tab[l+1]);
            if (r&1) ans = min(ans, tab[r-1]);
        }
        return ans;
    }
};

struct TreeMax{
    vector<int>tab;
    int size = 1;

    void init(int n){
        while (size < n) size*=2;
        tab.assign(2*size, -oo);
    }

    void update(int x, int v){
        x += size;
        tab[x] = max(tab[x], v);
        while (x){
            x/=2;
            tab[x] = max(tab[2*x], tab[2*x+1]);
        }
    }

    int query(int l, int r){
        int ans = -oo;
        for (l += size-1, r += size+1; r-l>1; l/=2, r/=2){
            if (!(l&1)) ans = max(ans, tab[l+1]);
            if (r&1) ans = max(ans, tab[r-1]);
        }
        return ans;
    }
};

void solve(){
    int n, k; cin >> n >> k;
    int m; cin >> m;
    vector<T>where(m);
    for (auto &[x, y]: where) cin >> x >> y;
    multiset<int>s;
    vector<T>sweep;
    //left to right
    for (int i = 0; i<m; i++){
        if (where[i].first < where[i].second){
            sweep.emplace_back(where[i].first, where[i].second);
            sweep.emplace_back(min(where[i].first + k, where[i].second), -where[i].second);
        }
    }
    sort(sweep.begin(), sweep.end());
    debug(sweep);
    vector<int>right(n+1);
    int ptr = -1;
    for (int i = 1; i<=n; i++){
        while (ptr + 1 < (int)sweep.size() && sweep[ptr+1].first <= i){
            ptr++;
            if (sweep[ptr].second > 0) s.insert(sweep[ptr].second);
            else s.erase(s.find(-sweep[ptr].second));
        }
        right[i] = (!s.empty() ? *s.rbegin() : i);
    }
    debug(right);

    //right to left
    s.clear(); sweep.clear();
    for (int i = 0; i<m; i++){
        if (where[i].first > where[i].second){
            sweep.emplace_back(where[i].first, where[i].second);
            sweep.emplace_back(max(where[i].first - k, where[i].second), -where[i].second);
        }
    }
    sort(sweep.begin(), sweep.end());
    debug(sweep);
    vector<int>left(n+1);
    ptr = (int)sweep.size();
    for (int i = n; i>=1; i--){
        while (ptr - 1 >= 0 && sweep[ptr-1].first >= i){
            ptr--;
            if (sweep[ptr].second > 0) s.insert(sweep[ptr].second);
            else s.erase(s.find(-sweep[ptr].second));
        }
        left[i] = (!s.empty() ? *s.begin() : i);
    }
    debug(left);
    vector<TreeMin>L(K);
    vector<TreeMax>R(K);
    for (int i = 0; i<K; i++){
        L[i].init(n+2);
        R[i].init(n+2);
    }
    for (int i = 1; i<=n; i++) {
        L[0].update(i, left[i]);
        R[0].update(i, right[i]);
    }
    for (int j = 1; j<K; j++){
        debug(j);
        for (int i = 1; i<=n; i++){
            int ll = L[j-1].query(i, i);
            int rr = R[j-1].query(i, i);
            L[j].update(i, L[j-1].query(ll, rr));
            R[j].update(i, R[j-1].query(ll, rr));
            debug(i, L[j-1].query(ll, rr), R[j-1].query(ll, rr));
        }
    }
    int q; cin >> q;
    while (q--){
        int a, b; cin >> a >> b;
        int ans = 0;
        int ll = a, rr = a;
        bool any = 0;
        for (int i = K-1; i>=0; i--){
            int newL = L[i].query(ll, rr);
            int newR = R[i].query(ll, rr);
            if (b >= newL && b <= newR){
                any = 1;
                ;
            } else {
                ans += (1<<i);
                ll = newL;
                rr = newR;
            }
        }
        if (!any) cout << "-1\n";
        else  cout << ans+1 << "\n";
    }
}

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

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 580 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 576 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 576 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 576 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 1 ms 580 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 576 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 576 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 576 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 10 ms 1748 KB Output is correct
14 Correct 8 ms 1740 KB Output is correct
15 Correct 6 ms 1620 KB Output is correct
16 Correct 7 ms 1664 KB Output is correct
17 Correct 6 ms 1748 KB Output is correct
18 Correct 5 ms 1748 KB Output is correct
19 Correct 5 ms 1740 KB Output is correct
20 Correct 5 ms 1656 KB Output is correct
21 Correct 5 ms 1684 KB Output is correct
22 Correct 5 ms 1748 KB Output is correct
23 Correct 6 ms 1748 KB Output is correct
24 Correct 6 ms 1748 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 474 ms 87868 KB Output is correct
2 Correct 451 ms 87840 KB Output is correct
3 Correct 521 ms 88316 KB Output is correct
4 Correct 434 ms 87716 KB Output is correct
5 Correct 359 ms 93760 KB Output is correct
6 Correct 482 ms 92548 KB Output is correct
7 Correct 335 ms 92904 KB Output is correct
8 Correct 311 ms 89556 KB Output is correct
9 Correct 315 ms 89608 KB Output is correct
10 Correct 358 ms 92516 KB Output is correct
11 Correct 380 ms 92472 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 89304 KB Output is correct
2 Correct 497 ms 94360 KB Output is correct
3 Correct 597 ms 89164 KB Output is correct
4 Correct 373 ms 93380 KB Output is correct
5 Correct 398 ms 95380 KB Output is correct
6 Correct 387 ms 95348 KB Output is correct
7 Correct 439 ms 93200 KB Output is correct
8 Correct 535 ms 93172 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 834 ms 95744 KB Output is correct
2 Correct 750 ms 89784 KB Output is correct
3 Correct 735 ms 87620 KB Output is correct
4 Correct 682 ms 86212 KB Output is correct
5 Correct 447 ms 85236 KB Output is correct
6 Correct 518 ms 84804 KB Output is correct
7 Correct 503 ms 89580 KB Output is correct
8 Correct 1 ms 576 KB Output is correct
9 Correct 9 ms 1796 KB Output is correct
10 Correct 576 ms 96640 KB Output is correct
11 Correct 568 ms 96624 KB Output is correct
12 Correct 600 ms 95920 KB Output is correct
13 Correct 572 ms 97776 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 9 ms 1920 KB Output is correct
16 Correct 492 ms 94268 KB Output is correct
17 Correct 716 ms 94396 KB Output is correct
18 Correct 702 ms 94496 KB Output is correct
19 Correct 653 ms 94452 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 580 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 576 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 576 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 576 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 10 ms 1748 KB Output is correct
14 Correct 8 ms 1740 KB Output is correct
15 Correct 6 ms 1620 KB Output is correct
16 Correct 7 ms 1664 KB Output is correct
17 Correct 6 ms 1748 KB Output is correct
18 Correct 5 ms 1748 KB Output is correct
19 Correct 5 ms 1740 KB Output is correct
20 Correct 5 ms 1656 KB Output is correct
21 Correct 5 ms 1684 KB Output is correct
22 Correct 5 ms 1748 KB Output is correct
23 Correct 6 ms 1748 KB Output is correct
24 Correct 6 ms 1748 KB Output is correct
25 Correct 474 ms 87868 KB Output is correct
26 Correct 451 ms 87840 KB Output is correct
27 Correct 521 ms 88316 KB Output is correct
28 Correct 434 ms 87716 KB Output is correct
29 Correct 359 ms 93760 KB Output is correct
30 Correct 482 ms 92548 KB Output is correct
31 Correct 335 ms 92904 KB Output is correct
32 Correct 311 ms 89556 KB Output is correct
33 Correct 315 ms 89608 KB Output is correct
34 Correct 358 ms 92516 KB Output is correct
35 Correct 380 ms 92472 KB Output is correct
36 Correct 483 ms 89304 KB Output is correct
37 Correct 497 ms 94360 KB Output is correct
38 Correct 597 ms 89164 KB Output is correct
39 Correct 373 ms 93380 KB Output is correct
40 Correct 398 ms 95380 KB Output is correct
41 Correct 387 ms 95348 KB Output is correct
42 Correct 439 ms 93200 KB Output is correct
43 Correct 535 ms 93172 KB Output is correct
44 Correct 834 ms 95744 KB Output is correct
45 Correct 750 ms 89784 KB Output is correct
46 Correct 735 ms 87620 KB Output is correct
47 Correct 682 ms 86212 KB Output is correct
48 Correct 447 ms 85236 KB Output is correct
49 Correct 518 ms 84804 KB Output is correct
50 Correct 503 ms 89580 KB Output is correct
51 Correct 1 ms 576 KB Output is correct
52 Correct 9 ms 1796 KB Output is correct
53 Correct 576 ms 96640 KB Output is correct
54 Correct 568 ms 96624 KB Output is correct
55 Correct 600 ms 95920 KB Output is correct
56 Correct 572 ms 97776 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 9 ms 1920 KB Output is correct
59 Correct 492 ms 94268 KB Output is correct
60 Correct 716 ms 94396 KB Output is correct
61 Correct 702 ms 94496 KB Output is correct
62 Correct 653 ms 94452 KB Output is correct
63 Correct 674 ms 88468 KB Output is correct
64 Correct 809 ms 88876 KB Output is correct
65 Correct 691 ms 88528 KB Output is correct
66 Correct 534 ms 94352 KB Output is correct
67 Correct 784 ms 93316 KB Output is correct
68 Correct 408 ms 93636 KB Output is correct
69 Correct 417 ms 95348 KB Output is correct
70 Correct 535 ms 93152 KB Output is correct
71 Correct 577 ms 93300 KB Output is correct