Submission #313301

#TimeUsernameProblemLanguageResultExecution timeMemory
313301kaplanbarLightning Rod (NOI18_lightningrod)C++17
80 / 100
2021 ms88112 KiB
#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++) { 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 += 1^v[i]; 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...