Submission #1023946

#TimeUsernameProblemLanguageResultExecution timeMemory
1023946lucriSails (IOI07_sails)C++17
50 / 100
1098 ms2272 KiB
#include <bits/stdc++.h> using namespace std; long long n,hmax; long long ans; struct barci{int h;long long w;}v[100010]; stack<pair<int,int>>s,ss; bool comp(barci a,barci b) { return a.h<b.h; } void adauga(long long cost,long long length) { if(!s.empty()&&cost==s.top().first) { length+=s.top().second; s.pop(); } s.push({cost,length}); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n; for(long long i=1;i<=n;++i) cin>>v[i].h>>v[i].w; sort(v+1,v+n+1,comp); for(long long i=1;i<=n;++i) { if(v[i].h>hmax) { adauga(0,v[i].h-hmax); hmax=v[i].h; } while(v[i].w) { if(v[i].w>=s.top().second) { ss.push({s.top().first+1,s.top().second}); ans+=s.top().first*s.top().second; v[i].w-=s.top().second; s.pop(); } else { ans+=v[i].w*s.top().first; ss.push({s.top().first,s.top().second-v[i].w}); ss.push({s.top().first+1,v[i].w}); v[i].w=0; s.pop(); } } while(!ss.empty()) { adauga(ss.top().first,ss.top().second); ss.pop(); } } 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...