# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313304 | kaplanbar | Lightning Rod (NOI18_lightningrod) | C++11 | 2093 ms | 75728 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;
using ll = long long;
constexpr int N = 1e7+1;
int n;
bool v[N];
pair<int,int> a[N];
int main() {
//ios_base::sync_with_stdio(false);
//cin.tie(0);
cin >> n;
for(int i = 0; i < n; i++) {
scanf("%d %d", &a[i].first, &a[i].second);
//cin >> a[i].first >> a[i].second;
}
int mx = -2000000000;
for(int i = 0; i < n; i++) {
int val = a[i].first + a[i].second;
if(mx >= val) {
v[i] = 1;
}
else {
mx = val;
}
}
mx = -2000000000;
for(int i = n - 1; i >= 0; i--) {
int val = a[i].second - a[i].first;
if(mx >= val) {
v[i] = 1;
}
else {
mx = val;
}
}
int ans = 0;
for(int i = 0; i < n; i++) ans += v[i];
//cout << n-ans;
printf("%d",n-ans);
return 0;
}
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... |