oj.uz

Submission #898044

# Submission time Handle Problem Language Result Execution time Memory
898044 2024-01-04T08:56:56 Z GrindMachine Event Hopping (BOI22_events) C++17
100 / 100
 111 ms 22612 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "impossible" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read the edi a long time ago, dont remember much from there except binary lifting

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int LOG = 17;

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
        pii a;
    };

    data neutral = {{inf1,inf1}};

    data merge(data &left, data &right) {
        data curr;
        curr.a = min(left.a,right.a);
        return curr;
    }

    void create(int i, T v) {

    }

    void modify(int i, T v) {
        tr[i].a = v;
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

void solve(int test_case)
{
    int n,q; cin >> n >> q;
    vector<pii> a(n+5);
    rep1(i,n) cin >> a[i].ff >> a[i].ss;

    auto cmp = [&](array<int,3> ar1, array<int,3> ar2){
        if(ar1[1] != ar2[1]) return ar1[1] < ar2[1];
        return ar1[0] < ar2[0];
    };

    vector<array<int,3>> b(n+5);
    rep1(i,n) b[i] = {a[i].ff,a[i].ss,i};
    sort(b.begin()+1,b.begin()+n+1,cmp);

    rep1(i,n) a[i] = {b[i][0],b[i][1]};

    vector<int> sorted_ind(n+5);
    rep1(i,n) sorted_ind[b[i][2]] = i;

    int up[n+5][LOG], down[n+5][LOG];

    vector<pii> enter(n+5);
    rep1(i,n){
        auto [l,r] = a[i];
        int lo = 1, hi = n;
        int first = -1;

        while(lo <= hi){
            int mid = (lo+hi) >> 1;
            if(l <= a[mid].ss){
                first = mid;
                hi = mid-1;
            }
            else{
                lo = mid+1;
            }
        }

        assert(first != -1);

        pii px = {r,i};
        amax(enter[first],px);
    }

    pii best = {-1,-1};
    int ptr = 1;

    rep1(i,n){
        amax(best,enter[i]);
        up[i][0] = best.ss;
    }

    segtree<pii> st(n+5);
    rep1(i,n) st.pupd(i,{a[i].ff,i});

    rep1(i,n){
        auto [l,r] = a[i];
        int first = -1, last = -1;

        int lo = 1, hi = n;
        while(lo <= hi){
            int mid = (lo+hi) >> 1;
            if(a[mid].ss >= l){
                first = mid;
                hi = mid-1;
            }
            else{
                lo = mid+1;
            }
        }

        lo = 1, hi = n;
        while(lo <= hi){
            int mid = (lo+hi) >> 1;
            if(a[mid].ss <= r){
                last = mid;
                lo = mid+1;
            }
            else{
                hi = mid-1;
            }
        }

        assert(first != -1 and last != -1);
        pii best = st.query(first,last).a;
        down[i][0] = best.ss;
    }

    /*

    rep1(i,n){
        auto [l,r] = a[i];
        pii best = {r,i};
        rep1(j,n){
            if(j == i) conts;
            auto [lx,rx] = a[j];
            if(lx <= r and rx >= r){
                pii px = {rx,j};
                amax(best,px);
            }
        }

        up[i][0] = best.ss;
    }

    rep1(i,n){
        auto [l,r] = a[i];
        pii best = {l,i};
        rep1(j,n){
            if(j == i) conts;
            auto [lx,rx] = a[j];
            if(l <= rx and r >= rx){
                pii px = {lx,j};
                amin(best,px);
            }
        }

        down[i][0] = best.ss;
    }
    
    */

    rep1(j,LOG-1){
        rep1(i,n){
            up[i][j] = up[up[i][j-1]][j-1];
            down[i][j] = down[down[i][j-1]][j-1];
        }
    }

    while(q--){
        int i,j; cin >> i >> j;
        i = sorted_ind[i];
        j = sorted_ind[j];

        if(i == j){
            cout << 0 << endl;
            conts;
        }

        if(a[i].ss > a[j].ss){
            no;
            conts;            
        }

        int ans = 0;

        rev(b,LOG-1,0){
            int p = up[i][b];
            if(a[p].ss < a[j].ss){
                ans += (1<<b);
                i = p;
            }
        }

        rev(b,LOG-1,0){
            int p = down[j][b];
            if(a[p].ff > a[i].ff){
                ans += (1<<b);
                j = p;
            }
        }

        int add = inf1;
        if(a[j].ff <= a[i].ss){
            add = 1;
        }
        else{
            j = down[j][0];
            if(a[i].ss >= a[j].ff and a[i].ss <= a[j].ss){
                add = 2;
            }   
        }

        ans += add;

        if(ans > inf1) no;
        else cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

events.cpp: In function 'void solve(int)':
events.cpp:173:9: warning: unused variable 'ptr' [-Wunused-variable]
  173 |     int ptr = 1;
      |         ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 78 ms 21280 KB Output is correct
3 Correct 92 ms 22048 KB Output is correct
4 Correct 89 ms 22004 KB Output is correct
5 Correct 83 ms 22100 KB Output is correct
6 Correct 86 ms 22160 KB Output is correct
7 Correct 81 ms 22248 KB Output is correct
8 Correct 79 ms 22488 KB Output is correct
9 Correct 80 ms 22612 KB Output is correct
10 Correct 105 ms 22468 KB Output is correct
11 Correct 95 ms 22380 KB Output is correct
12 Correct 70 ms 21728 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 488 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 488 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 28 ms 2644 KB Output is correct
20 Correct 27 ms 2512 KB Output is correct
21 Correct 31 ms 2852 KB Output is correct
22 Correct 22 ms 2900 KB Output is correct
23 Correct 22 ms 2768 KB Output is correct
24 Correct 21 ms 2684 KB Output is correct
25 Correct 32 ms 2380 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 424 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 57 ms 19668 KB Output is correct
20 Correct 53 ms 19612 KB Output is correct
21 Correct 65 ms 20288 KB Output is correct
22 Correct 60 ms 20412 KB Output is correct
23 Correct 56 ms 20216 KB Output is correct
24 Correct 62 ms 20308 KB Output is correct
25 Correct 44 ms 19536 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 21268 KB Output is correct
2 Correct 79 ms 22368 KB Output is correct
3 Correct 93 ms 22100 KB Output is correct
4 Correct 80 ms 22608 KB Output is correct
5 Correct 91 ms 22428 KB Output is correct
6 Correct 92 ms 22272 KB Output is correct
7 Correct 101 ms 22100 KB Output is correct
8 Correct 103 ms 22428 KB Output is correct
9 Correct 56 ms 20316 KB Output is correct
10 Correct 82 ms 21716 KB Output is correct
11 Correct 91 ms 21588 KB Output is correct
12 Correct 82 ms 21848 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 78 ms 21280 KB Output is correct
3 Correct 92 ms 22048 KB Output is correct
4 Correct 89 ms 22004 KB Output is correct
5 Correct 83 ms 22100 KB Output is correct
6 Correct 86 ms 22160 KB Output is correct
7 Correct 81 ms 22248 KB Output is correct
8 Correct 79 ms 22488 KB Output is correct
9 Correct 80 ms 22612 KB Output is correct
10 Correct 105 ms 22468 KB Output is correct
11 Correct 95 ms 22380 KB Output is correct
12 Correct 70 ms 21728 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 488 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 488 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 28 ms 2644 KB Output is correct
32 Correct 27 ms 2512 KB Output is correct
33 Correct 31 ms 2852 KB Output is correct
34 Correct 22 ms 2900 KB Output is correct
35 Correct 22 ms 2768 KB Output is correct
36 Correct 21 ms 2684 KB Output is correct
37 Correct 32 ms 2380 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 424 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 57 ms 19668 KB Output is correct
48 Correct 53 ms 19612 KB Output is correct
49 Correct 65 ms 20288 KB Output is correct
50 Correct 60 ms 20412 KB Output is correct
51 Correct 56 ms 20216 KB Output is correct
52 Correct 62 ms 20308 KB Output is correct
53 Correct 44 ms 19536 KB Output is correct
54 Correct 78 ms 21268 KB Output is correct
55 Correct 79 ms 22368 KB Output is correct
56 Correct 93 ms 22100 KB Output is correct
57 Correct 80 ms 22608 KB Output is correct
58 Correct 91 ms 22428 KB Output is correct
59 Correct 92 ms 22272 KB Output is correct
60 Correct 101 ms 22100 KB Output is correct
61 Correct 103 ms 22428 KB Output is correct
62 Correct 56 ms 20316 KB Output is correct
63 Correct 82 ms 21716 KB Output is correct
64 Correct 91 ms 21588 KB Output is correct
65 Correct 82 ms 21848 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 78 ms 21948 KB Output is correct
68 Correct 78 ms 22104 KB Output is correct
69 Correct 92 ms 22164 KB Output is correct
70 Correct 81 ms 22156 KB Output is correct
71 Correct 80 ms 22100 KB Output is correct
72 Correct 80 ms 22100 KB Output is correct
73 Correct 76 ms 22612 KB Output is correct
74 Correct 82 ms 22608 KB Output is correct
75 Correct 92 ms 22356 KB Output is correct
76 Correct 93 ms 22352 KB Output is correct
77 Correct 68 ms 21896 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 1 ms 604 KB Output is correct
80 Correct 1 ms 604 KB Output is correct
81 Correct 1 ms 756 KB Output is correct
82 Correct 1 ms 604 KB Output is correct
83 Correct 1 ms 856 KB Output is correct
84 Correct 1 ms 600 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 28 ms 2776 KB Output is correct
87 Correct 23 ms 2648 KB Output is correct
88 Correct 34 ms 3024 KB Output is correct
89 Correct 22 ms 3008 KB Output is correct
90 Correct 22 ms 2908 KB Output is correct
91 Correct 21 ms 2908 KB Output is correct
92 Correct 22 ms 2648 KB Output is correct
93 Correct 63 ms 20412 KB Output is correct
94 Correct 53 ms 19612 KB Output is correct
95 Correct 76 ms 20316 KB Output is correct
96 Correct 59 ms 20304 KB Output is correct
97 Correct 62 ms 20396 KB Output is correct
98 Correct 66 ms 20396 KB Output is correct
99 Correct 52 ms 19536 KB Output is correct
100 Correct 102 ms 22088 KB Output is correct
101 Correct 107 ms 22232 KB Output is correct
102 Correct 106 ms 22356 KB Output is correct
103 Correct 90 ms 21912 KB Output is correct
104 Correct 82 ms 21588 KB Output is correct
105 Correct 81 ms 21744 KB Output is correct
106 Correct 87 ms 21452 KB Output is correct
107 Correct 107 ms 21496 KB Output is correct
108 Correct 92 ms 22276 KB Output is correct
109 Correct 93 ms 22100 KB Output is correct
110 Correct 111 ms 22120 KB Output is correct
111 Correct 102 ms 22096 KB Output is correct