Submission #1139837

#TimeUsernameProblemLanguageResultExecution timeMemory
1139837mattsohLightning Rod (NOI18_lightningrod)C++20
66 / 100
1098 ms58700 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; stack<pair<ll,ll>> st; signed main(){ ll n;cin>>n; for (ll i = 0;i<n;i++){ ll x,y;cin>>x>>y; while (true){ if (st.size() == 0){ st.push({x,y}); continue; } ll sx = st.top().first, sy = st.top().second; if (x-sx<=sy-y) break; else if (x-sx <=y-sy) st.pop(); else { st.push({x,y}); break; } } } cout<<st.size()<<endl; }
#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...