Submission #1309517

#TimeUsernameProblemLanguageResultExecution timeMemory
1309517thecrazycandyLightning Rod (NOI18_lightningrod)C++20
80 / 100
1079 ms156204 KiB
#include <bits/stdc++.h> //#pragma GCC optimize("Ofast") //#pragma GCC target("avx,avx2,fma") using namespace std; #define ll int #define sped_up ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define rall(v) (v).rbegin(), (v).rend() #define all(v) (v).begin(), (v).end() #define pb push_back #define S second #define F first const ll INF = (ll)1e9 + 1, INFL = (ll)1e18 + 1; const ll mod = (ll)1e9 + 7, MAXN = (ll)1e7 + 7; ll p[MAXN], s[MAXN]; ll x[MAXN], y[MAXN]; int main() { sped_up; ll n; cin >> n; ll cnt = 0; p[0] = -INF*2; s[n + 1] = INF*2; for (int i = 1; i <= n; i++) { cin >> x[i] >> y[i]; p[i] = max(p[i - 1], x[i] + y[i]); } for (int i = n; i >= 1; i--) { s[i] = min(s[i + 1], x[i] - y[i]); if (s[i + 1] > x[i] - y[i] && x[i] + y[i] > p[i - 1]) cnt++; } cout << cnt; }
#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...