oj.uz

Submission #721869

# Submission time Handle Problem Language Result Execution time Memory
721869 2023-04-11T08:05:59 Z MDSPro Event Hopping (BOI22_events) C++17
0 / 100
 97 ms 12068 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(20,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 < 20; ++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;
        if(nxt[0][x] == n) return -1;
        if(nxt[0][x] > y) return 1;

        int cur = 0;
        for(int i = 19; i >= 0; --i){
            if(x == y) return cur;
            if(nxt[i][x] <= y) {
                cur |= (1<<i);
                x = nxt[i][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 1 ms 212 KB Output is correct
2 Correct 64 ms 11560 KB Output is correct
3 Correct 65 ms 11560 KB Output is correct
4 Correct 77 ms 11440 KB Output is correct
5 Incorrect 67 ms 11548 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 11824 KB Output is correct
2 Correct 97 ms 11500 KB Output is correct
3 Correct 86 ms 11464 KB Output is correct
4 Correct 58 ms 12068 KB Output is correct
5 Incorrect 87 ms 11416 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 64 ms 11560 KB Output is correct
3 Correct 65 ms 11560 KB Output is correct
4 Correct 77 ms 11440 KB Output is correct
5 Incorrect 67 ms 11548 KB Output isn't correct
6 Halted 0 ms 0 KB -