Submission #1024028

#TimeUsernameProblemLanguageResultExecution timeMemory
1024028lucriSails (IOI07_sails)C++14
80 / 100
1054 ms5456 KiB
#include <bits/stdc++.h> using namespace std; int n,hmax; long long ans; int lss,ls,h,w; pair<int,int>v[1<<18],ss[1<<18],s[1<<18]; static inline void adauga(int cost,int length) { if(ls&&cost==s[ls].first) { length+=s[ls].second; --ls; } s[++ls]={cost,length}; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n; for(int i=1;i<=n;++i) cin>>v[i].first>>v[i].second; sort(v+1,v+n+1); for(int i=1;i<=n;++i) { h=v[i].first; w=v[i].second; if(h>hmax) { adauga(0,h-hmax); hmax=h; } while(w) { if(w>=s[ls].second) { ss[++lss]={s[ls].first+1,s[ls].second}; ans+=1LL*s[ls].first*s[ls].second; w-=s[ls].second; --ls; } else { ans+=1LL*w*s[ls].first; ss[++lss]={s[ls].first,s[ls].second-w}; ss[++lss]={s[ls].first+1,w}; w=0; --ls; } } while(lss) { adauga(ss[lss].first,ss[lss].second); --lss; } } cout<<ans; return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...