Submission #1340716

#TimeUsernameProblemLanguageResultExecution timeMemory
1340716uranhishigLightning Rod (NOI18_lightningrod)C++20
66 / 100
1100 ms156248 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    int n;
    cin >> n;
    vector<int> x(n);
    vector<int> y(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
    }
    vector<int> pf(n, x[0] + y[0]), sf(n, x[n - 1] - y[n - 1]);
    for (int i = 1; i < n; i++) {
         pf[i] = max(pf[i-1], x[i] + y[i]);
     }
    for (int i = n-2; i >= 0; i--) {
        sf[i] = min(sf[i+1], x[i] - y[i]);
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int l = (i > 0 ? pf[i-1] : -1e18);
        int r = (i < n-1 ? sf[i+1] : 1e18);
        if (x[i] + y[i] > l and x[i] - y[i] < r) ans++;
    }
    cout << ans;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...