Submission #1120170

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120170		madiyar	Event Hopping (BOI22_events)	C++17	0 / 100	1566 ms	8876 KiB

events

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef int ll;
vector<ll> g[200100];
ll d[200100];
bool ok(pair<ll, pair<ll, ll>> a, pair<ll, pair<ll, ll>> b) {
    return (b.s.f <= a.f);
}
void solve() {
    ll n; cin>>n;
    ll Q; cin>>Q;
    vector<pair<ll, pair<ll, ll>>> v;
    for(ll i=1; i<=n; i++) {
        ll l,r; cin>>l>>r;
        v.push_back({r, {l, i}});
    }
    sort(v.begin(), v.end());
    for(ll i=0; i<(ll)v.size(); i++) {
        for(ll j=i+1; j<(ll)v.size(); j++) {
            if(ok(v[i], v[j])) {
                g[v[i].s.s].push_back(v[j].s.s);
            }
        }
    }
    while(Q--) {
        ll x,y; cin>>x>>y;
        queue<ll> q;
        for(ll i=1; i<=n; i++) d[i]=1e9;
        d[x]=0;
        q.push(x);
        while(!q.empty()) {
            ll v=q.front();
            q.pop();
            for(auto to: g[v]) {
                if(d[to] > d[v]+1) {
                    d[to]=d[v]+1;
                    q.push(to);
                }
            }
        }
        if(d[y] == 1e9) cout<<"impossible\n";
        else cout<<d[y]<<'\n';
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) {
        solve();
        cout<<'\n';
    }
}

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