# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862259 | TAhmed33 | Osumnjičeni (COCI21_osumnjiceni) | C++98 | 1084 ms | 8160 KiB |
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 () {
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 q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
set <int> cur;
vector <pair <int, int>> p;
for (int i = l; i <= r; i++) {
p.push_back(arr[i]);
}
sort(p.begin(), p.end());
int ans = 0;
for (auto [x, y] : p) {
if (cur.empty()) {
cur.insert(y);
ans = max(ans, 1);
continue;
}
auto l = cur.begin();
if (*l >= x) {
cur.insert(y);
} else {
cur.erase(l);
cur.insert(y);
}
ans = max(ans, (int)cur.size());
}
cout << ans << '\n';
}
}
Compilation message (stderr)
# | 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... |