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;
#define ll long long
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
int ans = 0;
vector<int>x(n), y(n);
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
}
vector<int> pre(n),suf(n);
for (int i = 0; i < n; ++i) {
pre[i] = x[i] + y[i];
if (i > 0) pre[i] = max(pre[i-1], pre[i]);
}
for (int i = n-1; i >= 0; --i) {
suf[i] = y[i] - x[i];
if (i < n-1) suf[i] = max(suf[i+1],suf[i]);
}
for (int i = 0; i < n; ++i) {
if (x[i] + y[i] == pre[i] && y[i] - x[i] == suf[i]) {
ans++;
}
}
cout << ans << "\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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |