| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1335820 | enson | Bikeparking (EGOI24_bikeparking) | C++20 | 30 ms | 5128 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int X[N], Y[N];
for(int i = 0; i < N; i++) cin >> X[i];
for(int i = 0; i < N; i++) cin >> Y[i];
int x = 0, U = 0, D = 0;
for(int i = 0; i < N; i++){
if (x == i) x++;
while (X[i] >= Y[x] && x < N){
X[i] -= Y[x];
U += Y[x];
Y[x] = 0;
x++;
}
if (x >= N) break;
Y[x] -= X[i];
U += X[i];
X[i] = 0;
}
for(int i = 0; i < N; i++){
if (X[i] == 0)D += Y[i];
else D += Y[i]-min(X[i], Y[i]);
}
cout << U-D;
}
| # | 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... | ||||
