oj.uz

Submission #721714

# Submission time Handle Problem Language Result Execution time Memory
721714 2023-04-11T06:47:12 Z MDSPro Event Hopping (BOI22_events) C++17
0 / 100
 121 ms 13120 KB 
#include "bits/stdc++.h"

using namespace std;

int main(){
    cin.tie(0)->sync_with_stdio(0);

    int n,q; cin >> n >> q;
    vector<tuple<int,int,int>> ev;
    for(int i = 0; i < n; ++i){
        int x,y; cin >> x >> y;
        ev.emplace_back(x,y,i+1);
    }

    sort(ev.begin(),ev.end());  

    vector<int> nw_order(n+1);
    vector<int> left(n),right(n);
    for(int i = 0; i < n; ++i) {
        left[i] = get<0>(ev[i]);
        right[i] = get<1>(ev[i]);
        nw_order[get<2>(ev[i])] = i;
    }

    vector<vector<int>> nxt(23,vector<int>(n+1));
    nxt[0][n] = n;

    int r = 0;
    for(int i = 0; i < n; ++i){
        while(r+1 < n && left[r+1] <= right[i]) r++;

        if(i != r) nxt[0][i] = r;
        else nxt[0][i] = n;
    }
    for(int i = 1; i < 23; ++i) {
        for(int j = 0; j <= n; ++j){
            nxt[i][j] = nxt[i-1][nxt[i-1][j]];
        }
    }

    auto get = [&](int x, int y){
        if(x == y) return 0;

        int cur = 0;
        for(int i = 22; i >= 0; --i){
            if(nxt[i][x] < y) {
                cur += (1<<i);
                x = nxt[i][x];
            }
        }
        cur++;
        x = nxt[0][x];

        if(x != y) return -1;
        return cur;
    };

    while(q--){
        int a,b; cin >> a >> b;
        a = nw_order[a];
        b = nw_order[b];

        int ans = get(a,b);
        if(ans == -1) cout << "impossible\n";
        else cout << ans << '\n';
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 79 ms 12572 KB Output is correct
3 Correct 70 ms 12564 KB Output is correct
4 Correct 76 ms 12636 KB Output is correct
5 Incorrect 85 ms 12620 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 12572 KB Output is correct
2 Correct 73 ms 12616 KB Output is correct
3 Correct 91 ms 12636 KB Output is correct
4 Correct 79 ms 13120 KB Output is correct
5 Correct 119 ms 12980 KB Output is correct
6 Incorrect 121 ms 13072 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 79 ms 12572 KB Output is correct
3 Correct 70 ms 12564 KB Output is correct
4 Correct 76 ms 12636 KB Output is correct
5 Incorrect 85 ms 12620 KB Output isn't correct
6 Halted 0 ms 0 KB -