oj.uz

Submission #1081822

# Submission time Handle Problem Language Result Execution time Memory
1081822 2024-08-30T11:37:03 Z Tymond Event Hopping (BOI22_events) C++17
100 / 100
 107 ms 16100 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 1e5 + 7;
const int BASE = (1 << 17);
const int MAXK = 20;
int pos[MAXN];
pii tree[2 * BASE + 7];
int range[MAXK][MAXN];
vector<pair<pii, int>> vec;
int n, q;

pii smaller(pii x, pii y){
    if(x.fi != y.fi){
        return (x.fi < y.fi ? x : y);
    }
    return (x.se < y.se ? x : y);
}

void upd(int ind, pii val){
    ind += BASE;
    tree[ind] = val;
    ind /= 2;
    while(ind > 0){
        tree[ind] = smaller(tree[2 * ind], tree[2 * ind + 1]);
        ind /= 2;
    }
}

pii query(int v, int l, int p, int a, int b){
    if(p < a || b < l){
        return {1e9, 1e9};
    }

    if(a <= l && p <= b){
        return tree[v];
    }
    int mid = (l + p) / 2;
    return smaller(query(2 * v, l, mid, a, b), query(2 * v + 1, mid + 1, p, a, b));
}

void preprocessing(){
    for(int i = 0; i < 2 * BASE + 7; i++){
        tree[i] = {1e9, 1e9};
    }

    for(int i = 0; i < n; i++){
        upd(i, {vec[i].fi.fi , i});
    }
   // cout << "RANGES\n";
    for(int i = 0; i < n; i++){
        int l = 0;
        int p = i;
        int s;
        while(l < p){
            s = (l + p) / 2;
            if(vec[s].fi.se < vec[i].fi.fi){
                l = s + 1;
            }else{
                p = s;
            }
        }
      //  cout << i << ' ' << l << ' ';
        range[0][i] = query(1, 0, BASE - 1, l, i).se;
       // cout << range[0][i] << '\n';
    }

    for(int k = 1; k < MAXK; k++){
        for(int i = 0; i < n; i++){
            range[k][i] = range[k - 1][range[k - 1][i]];
        }
    }
}

int solve(int a, int b){
    if(vec[a].fi.se >= vec[b].fi.fi && vec[a].fi.se <= vec[b].fi.se){
        return 1;
    }

    if(vec[a].fi.se > vec[b].fi.se){
        return -1;
    }

    int res = 0;
    int akt = b;
    for(int i = MAXK - 1; i >= 0; i--){
        int nr = range[i][akt];
        if(vec[a].fi.se >= vec[nr].fi.fi){
            continue;
        }
        res += (1 << i);
        akt = nr;
        if(vec[a].fi.se >= vec[akt].fi.fi && vec[a].fi.se <= vec[akt].fi.se){
            return res + 1;
        }
    }
    res++;
    akt = range[0][akt];
    if(vec[a].fi.se >= vec[akt].fi.fi && vec[a].fi.se <= vec[akt].fi.se){
        return res + 1;
    }

    return -1;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
        int s,e;
        cin >> s >> e;
        vec.pb({{e, s}, i});
    }

    sort(all(vec));
    for(int i = 0; i < n; i++){
        swap(vec[i].fi.fi, vec[i].fi.se);
        pos[vec[i].se] = i;
    }

    preprocessing();

    /*for(auto ele : vec){
        cout << ele.fi.fi << ' ' << ele.fi.se << '\n';
    }

    for(int i = 0; i < n; i++){
        for(int j = 0; j < MAXK / 2; j++){
            cout << range[j][i] << ' ';
        }
        cout << '\n';
    }*/

    while(q--){
        int s, e;
        cin >> s >> e;
        s = pos[s];
        e = pos[e];
       // cout << "PYTANIE: " << s << ' ' << e << '\n';
        if(s == e){
            cout << 0 << '\n';
            continue;
        }

        int ans = solve(s, e);
        if(ans == -1){
            cout << "impossible\n";
        }else{
            cout << ans << '\n';
        }
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 72 ms 12564 KB Output is correct
3 Correct 74 ms 12496 KB Output is correct
4 Correct 80 ms 12484 KB Output is correct
5 Correct 81 ms 12484 KB Output is correct
6 Correct 81 ms 12528 KB Output is correct
7 Correct 78 ms 12640 KB Output is correct
8 Correct 72 ms 12992 KB Output is correct
9 Correct 81 ms 15980 KB Output is correct
10 Correct 89 ms 16072 KB Output is correct
11 Correct 87 ms 16064 KB Output is correct
12 Correct 65 ms 15368 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2532 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2532 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2536 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 26 ms 4432 KB Output is correct
20 Correct 27 ms 4692 KB Output is correct
21 Correct 27 ms 4892 KB Output is correct
22 Correct 21 ms 4956 KB Output is correct
23 Correct 20 ms 4688 KB Output is correct
24 Correct 18 ms 4700 KB Output is correct
25 Correct 21 ms 4440 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2532 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 3 ms 2652 KB Output is correct
13 Correct 2 ms 2532 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2568 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2528 KB Output is correct
19 Correct 58 ms 13860 KB Output is correct
20 Correct 54 ms 12992 KB Output is correct
21 Correct 66 ms 13760 KB Output is correct
22 Correct 58 ms 13764 KB Output is correct
23 Correct 56 ms 13760 KB Output is correct
24 Correct 66 ms 13760 KB Output is correct
25 Correct 52 ms 13256 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 12480 KB Output is correct
2 Correct 76 ms 12640 KB Output is correct
3 Correct 79 ms 12448 KB Output is correct
4 Correct 75 ms 12996 KB Output is correct
5 Correct 88 ms 12992 KB Output is correct
6 Correct 97 ms 12736 KB Output is correct
7 Correct 107 ms 12532 KB Output is correct
8 Correct 90 ms 12788 KB Output is correct
9 Correct 55 ms 11968 KB Output is correct
10 Correct 82 ms 12228 KB Output is correct
11 Correct 80 ms 12112 KB Output is correct
12 Correct 79 ms 12224 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 72 ms 12564 KB Output is correct
3 Correct 74 ms 12496 KB Output is correct
4 Correct 80 ms 12484 KB Output is correct
5 Correct 81 ms 12484 KB Output is correct
6 Correct 81 ms 12528 KB Output is correct
7 Correct 78 ms 12640 KB Output is correct
8 Correct 72 ms 12992 KB Output is correct
9 Correct 81 ms 15980 KB Output is correct
10 Correct 89 ms 16072 KB Output is correct
11 Correct 87 ms 16064 KB Output is correct
12 Correct 65 ms 15368 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2532 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 2536 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 26 ms 4432 KB Output is correct
32 Correct 27 ms 4692 KB Output is correct
33 Correct 27 ms 4892 KB Output is correct
34 Correct 21 ms 4956 KB Output is correct
35 Correct 20 ms 4688 KB Output is correct
36 Correct 18 ms 4700 KB Output is correct
37 Correct 21 ms 4440 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 3 ms 2652 KB Output is correct
41 Correct 2 ms 2532 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 2 ms 2568 KB Output is correct
44 Correct 2 ms 2652 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 2 ms 2528 KB Output is correct
47 Correct 58 ms 13860 KB Output is correct
48 Correct 54 ms 12992 KB Output is correct
49 Correct 66 ms 13760 KB Output is correct
50 Correct 58 ms 13764 KB Output is correct
51 Correct 56 ms 13760 KB Output is correct
52 Correct 66 ms 13760 KB Output is correct
53 Correct 52 ms 13256 KB Output is correct
54 Correct 73 ms 12480 KB Output is correct
55 Correct 76 ms 12640 KB Output is correct
56 Correct 79 ms 12448 KB Output is correct
57 Correct 75 ms 12996 KB Output is correct
58 Correct 88 ms 12992 KB Output is correct
59 Correct 97 ms 12736 KB Output is correct
60 Correct 107 ms 12532 KB Output is correct
61 Correct 90 ms 12788 KB Output is correct
62 Correct 55 ms 11968 KB Output is correct
63 Correct 82 ms 12228 KB Output is correct
64 Correct 80 ms 12112 KB Output is correct
65 Correct 79 ms 12224 KB Output is correct
66 Correct 1 ms 2396 KB Output is correct
67 Correct 79 ms 15704 KB Output is correct
68 Correct 85 ms 15552 KB Output is correct
69 Correct 84 ms 15656 KB Output is correct
70 Correct 84 ms 15676 KB Output is correct
71 Correct 86 ms 15676 KB Output is correct
72 Correct 86 ms 15704 KB Output is correct
73 Correct 91 ms 16100 KB Output is correct
74 Correct 80 ms 16100 KB Output is correct
75 Correct 90 ms 16068 KB Output is correct
76 Correct 87 ms 16064 KB Output is correct
77 Correct 73 ms 15232 KB Output is correct
78 Correct 2 ms 2392 KB Output is correct
79 Correct 2 ms 2652 KB Output is correct
80 Correct 2 ms 2652 KB Output is correct
81 Correct 1 ms 2652 KB Output is correct
82 Correct 2 ms 2652 KB Output is correct
83 Correct 2 ms 2652 KB Output is correct
84 Correct 1 ms 2652 KB Output is correct
85 Correct 2 ms 2652 KB Output is correct
86 Correct 24 ms 4444 KB Output is correct
87 Correct 21 ms 4700 KB Output is correct
88 Correct 27 ms 4692 KB Output is correct
89 Correct 21 ms 4828 KB Output is correct
90 Correct 19 ms 4700 KB Output is correct
91 Correct 17 ms 4700 KB Output is correct
92 Correct 20 ms 4444 KB Output is correct
93 Correct 56 ms 13896 KB Output is correct
94 Correct 53 ms 13116 KB Output is correct
95 Correct 72 ms 13768 KB Output is correct
96 Correct 57 ms 13768 KB Output is correct
97 Correct 56 ms 13768 KB Output is correct
98 Correct 62 ms 13760 KB Output is correct
99 Correct 52 ms 13232 KB Output is correct
100 Correct 96 ms 15812 KB Output is correct
101 Correct 92 ms 15816 KB Output is correct
102 Correct 89 ms 15912 KB Output is correct
103 Correct 78 ms 15300 KB Output is correct
104 Correct 85 ms 15072 KB Output is correct
105 Correct 80 ms 15304 KB Output is correct
106 Correct 87 ms 15044 KB Output is correct
107 Correct 90 ms 14972 KB Output is correct
108 Correct 89 ms 15824 KB Output is correct
109 Correct 88 ms 15808 KB Output is correct
110 Correct 99 ms 15600 KB Output is correct
111 Correct 100 ms 15552 KB Output is correct