| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335817 | itslq | Bikeparking (EGOI24_bikeparking) | C++20 | 31 ms | 5132 KiB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N; cin >> N;
vector<int> X(N), Y(N);
int c = 0, ans = 0;
for (int i = 0; i < N; i++) cin >> X[i];
for (int i = 0; i < N; i++) {
cin >> Y[i];
while (Y[i] && Y[i] >= X[c] && c < i) {
Y[i] -= X[c];
ans += X[c];
X[c++] = 0;
}
if (Y[i] && c < i) {
X[c] -= Y[i];
ans += Y[i];
Y[i] = 0;
}
}
for (int i = 0; i < N; i++) {
if (Y[i] && Y[i] >= X[i]) {
Y[i] -= X[i];
X[i] = 0;
} else if (Y[i]) {
X[i] -= Y[i];
Y[i] = 0;
}
}
for (int i = 0; i < N; i++) ans -= Y[i];
cout << ans;
}| # | 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... | ||||
