# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
737835 | lobo_prix | Potatoes and fertilizers (LMIO19_bulves) | C++17 | 191 ms | 19244 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//[Author] tuxedcat
//[Date] 2023.05.07 14:40:59 KST
//[File] src/c.cpp
//[Library] https://github.com/tuxedcat/ps.cpp
//[Revision] e876fc2f8914923aefbd4b1a0920d88253b54882
/* ORIGINAL_MAIN_SOURCE
#include "core/base.h"
signed main(){
void solve();
// for(int ti=1,t=get<0>(input());ti<=t;ti++)
// print("Case #",ti,": "),
solve();
assert(cin.get()=='\n');
assert(cin.get()==EOF);
}
#include "dp/slope.h"
void solve(){
int n; cin>>n;
Arr<int> a(n);
for(int i=0;i<n;i++){
int x,y; cin>>x>>y;
a[i]=x-y;
}
Arr<int> b(n+1);
partial_sum(a.begin(),a.end(),b.begin());
// dbg(b);
LeftHull z;
for(int i=0;i<n;i++){
z.pf_dec( max(0ll,b[i]) );
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |