#include <bits/stdc++.h>
using namespace std;
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) {
if (a.s == b.s) return a.e < b.e;
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].s > events[i-1].e || events[i-1].e > events[i].e)) 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 time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
101 ms |
8324 KB |
Output is correct |
2 |
Correct |
143 ms |
8236 KB |
Output is correct |
3 |
Correct |
163 ms |
8340 KB |
Output is correct |
4 |
Correct |
140 ms |
8916 KB |
Output is correct |
5 |
Correct |
164 ms |
8672 KB |
Output is correct |
6 |
Incorrect |
152 ms |
8512 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |