Submission #133651

#TimeUsernameProblemLanguageResultExecution timeMemory
133651miguelLightning Rod (NOI18_lightningrod)C++14
66 / 100
2021 ms178704 KiB
#include<bits/stdc++.h> using namespace std; #define rc(x) return cout<<x<<endl,0 #define pb push_back #define dbg(x) cout << #x << '=' << x << '\n'; #define ll long long #define sz size() #define x first #define y second #define pi pair <int, int> #define pii pair <pi, pi> #define vi vector <int> const ll nmax=5e4+2; const ll mod = 998244353; int n, x[10000001], y[10000001]; bool cov[10000001]; int32_t main(){ ios_base :: sync_with_stdio(0); cin.tie(); cout.tie(); cin>>n; int mx=-2e9-1; for(int i=1; i<=n; i++){ cin>>x[i]>>y[i]; if(mx<x[i]+y[i]){ mx=x[i]+y[i]; } else cov[i]=1; } mx=-2e9-1; for(int i=n; i>=1; i--){ //cin>>x[i]>>y[i]; if(mx<y[i]-x[i]){ mx=-x[i]+y[i]; } else cov[i]=1; } int ans=0; for(int i=1; i<=n; i++){ ans+=(cov[i]==0); } cout<<ans; }
#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...