| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1336437 | enson | Bikeparking (EGOI24_bikeparking) | C++20 | 31 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 ans = 0;
int U = 0, D = 0, O = 0;
for(int i = N-1; i >= 0; i--){
int md = min(D, X[i]);
U += md;
D -= md;
X[i] -= md;
int mo = min(O, X[i]);
U += mo;
O -= mo;
X[i] -= mo;
int my = min(X[i], Y[i]);
O += my;
X[i] -= my;
Y[i] -= my;
D += 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... | ||||
