이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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) {
return a.e < b.e;
});
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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |