제출 #745908

#제출 시각아이디문제언어결과실행 시간메모리
745908vjudge1Event Hopping (BOI22_events)C++17
0 / 100
170 ms8772 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 100001; const int K = 20; struct Event { int s, e, idx; }; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, q; cin >> n >> q; vector<Event> events(n); int j = 0; for (Event &i : events) { cin >> i.s >> i.e; i.idx = ++j; } sort(events.begin(), events.end(), [&](Event a, Event b) { return a.s < b.s; }); map<int, pair<int, int>> m; int segment = 1; for (int i = 0; i < n; i++) { if (i && events[i-1].e < events[i].s) segment++; m[events[i].idx] = {i, segment}; } while (q--) { int a, b; cin >> a >> b; if (m[a].second != m[b].second) { cout << "impossible\n"; continue; } a = m[a].first; b = m[b].first; if (a > b) cout << "impossible\n"; else cout << b-a << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...