# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200035 | wilwxk | Lightning Rod (NOI18_lightningrod) | C++14 | 2017 ms | 164624 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;
set<pair<int, int> > s;
int n;
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
int a, b; scanf("%d %d", &a, &b);
int x = a+b; int y = b-a;
auto sit = s.lower_bound({x, y});
if(sit != s.end() && sit->second >= y) continue;
if(sit != s.end() && make_pair(x, y) > (*sit)) sit = prev(s.erase(sit));
while(sit != s.begin() && prev(sit)->second <= y) sit = s.erase(prev(sit));
s.insert({x, y});
}
printf("%d\n", int(s.size()));
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |