| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335835 | 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 = N-1, U = 0, D = 0;
for(int i = N-1; i > 0; i--){
if (i == x) x--;
while (Y[i] >= X[x] && x >= 0){
Y[i] -= X[x];
U += X[x];
X[x] = 0;
x--;
}
if (x < 0) break;
U += Y[i];
X[x] -= Y[i];
}
for(int i = N-1; i >= 0; i--){
D += Y[i] - min(Y[i], X[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... | ||||
