This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
pair <int, int> arr[n + 1];
for (int i = 1; i <= n; i++) cin >> arr[i].first >> arr[i].second;
int nxt[n + 1] = {};
nxt[n] = n;
for (int i = n - 1; i >= 1; i--) {
nxt[i] = n;
multiset <pair <int, int>> cur;
cur.insert(arr[i]);
for (int j = i + 1; j <= n; j++) {
auto l = cur.lower_bound({arr[j].second + 1, 0});
if (l == cur.begin()) {
cur.insert(arr[j]);
continue;
}
l--;
auto x = *l;
if (x.second < arr[j].first) {
cur.insert(arr[j]);
continue;
}
nxt[i] = j - 1; break;
}
}
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
int cnt = 1;
for (int i = l + 1; i <= r; i++) if (nxt[i] != nxt[i - 1]) cnt++;
cout << cnt << '\n';
}
}
# | 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... |