Submission #1120641

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120641		vjudge1	Event Hopping (BOI22_events)	C++17	0 / 100	1596 ms	8236 KiB

events

#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'
#define int long long

typedef long long ll;
using namespace std;
const int maxn = 2e5 + 12;
const int mod = 1e9 + 7;

int up[20][maxn];
int l[maxn], r[maxn];
int n, q;

void solve() {
    cin >> n >> q;
    vector<pair<int, int>> u;
    for(int i = 1; i <= n; i++) {
        cin >> l[i] >> r[i];
        u.push_back({l[i], -i});
        u.push_back({r[i], i});
    }
    sort(u.begin(), u.end());
    while(q--) {
        int i, j;
        cin >> i >> j;
        if(r[i] > r[j]) {
            cout << "impossible\n";
            continue;
        }
        if(i == j) {
            cout << "0\n";
            continue;
        }
        int ans = 0;
        pair<int, int> mx = {-1, -1};
        for(auto [x, pos] : u) {
            if(pos < 0) {
                if(r[-pos] > r[j]) continue;
                mx = max(mx, {r[-pos], -pos});
            }
            else {
                up[0][pos] = mx.second;
            }
        }
        for(int _ = 0; _ <= n && i != j; _++) {
            ans++;
            i = up[0][i];
        }
        if(ans > n) {
            cout << "impossible\n";
        }
        else {
            cout << ans << ent;
        }
    }

}

signed main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;

//    cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30