Submission #190381

#TimeUsernameProblemLanguageResultExecution timeMemory
190381mrtsima22Lightning Rod (NOI18_lightningrod)C++17
80 / 100
2024 ms175496 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define two pair<int,int> #define pb push_back #define f first #define s second #define sz(container) (int)(container.size()) inline int bin(){ int x=0;char ch=getchar(); while (ch<'0'||ch>'9') ch=getchar(); while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar(); return x; } int n; stack<two>st; int main(){ n=bin(); for(int i=1;i<=n;++i){ int x=bin(); int y=bin(); bool ok=1; while(!st.empty()){ int a=st.top().f; int b=st.top().s; if(x-a<=b-y){ ok=0; break; } if(x-a<=y-b){ st.pop(); }else{ break; } } if(ok){ st.push({x,y}); } } printf("%d\n",sz(st)); // you should actually read the stuff at the bottom } /* stuff you should look for * int overflow, array bounds * special cases (n=1?), slow multiset operations * do smth instead of nothing and stay organized * unordered_map, hash_map, scanf, calculate answer instead of ans*K */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#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...