| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1336444 | yc11 | Bikeparking (EGOI24_bikeparking) | C++20 | 107 ms | 5104 KiB |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
vector<int> n1;
vector<int> n2;
signed main(){
cin>>n;
n1.resize(n);
n2.resize(n);
for (int i = 0;i<n;i++) cin>>n1[i];
for (int i = 0;i<n;i++) cin>>n2[i];
int d = 0;
int u = 0;
int o = 0;
for (int i = n-1;i>=0;i--){
if (n1[i]>d){
n1[i]-=d;
u +=d;
d = 0;
}
else{
u+=n1[i];
d+=n2[i];
d-=n1[i];
continue;
}
if (n1[i]>o){
n1[i]-=o;
u+=o;
o = 0;
}
else{
u+=n1[i];
o-=n1[i];
d+=n2[i];
continue;
}
o+=min(n2[i],n1[i]);
if (n2[i]>n1[i]) d+=n2[i]-n1[i];
}
cout<<u-d;
return 0;
}
| # | 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... | ||||
