Submission #131258

#TimeUsernameProblemLanguageResultExecution timeMemory
131258FedericoSLightning Rod (NOI18_lightningrod)C++14
66 / 100
2063 ms20252 KiB
#include <iostream> #include <algorithm> using namespace std; int N; int X[10000007]; int Y[10000007]; bool B[10000007]; int ans,a; bool comp(int a, int b){ return Y[a]>Y[b]; } int main(){ cin>>N; for(int i=0;i<N;i++) cin>>X[i]>>Y[i]; a=-2e9-5; for(int i=0;i<N;i++){ if(a<X[i]+Y[i]) a=X[i]+Y[i]; else B[i]=true; } a=-2e9-5; for(int i=N-1;i>=0;i--){ if(a<-X[i]+Y[i]) a=-X[i]+Y[i]; else B[i]=true; } for(int i=0;i<N;i++) ans+=!B[i]; 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...