| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1330221 | AMel0n | Bikeparking (EGOI24_bikeparking) | C++20 | 31 ms | 4956 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 7;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
int N;
cin >> N;
vector<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 res = 0;
vector<int> stk;
for(int i = 1; i < N; i++) {
int d = min(X[i-1], Y[i]);
res += d;
X[i-1] -= d;
Y[i] -= d;
if (X[i-1]) stk.push_back(i-1);
else {
while(stk.size()) {
int d = min(X[stk.back()], Y[i]);
res += d;
X[stk.back()] -= d;
Y[i] -= d;
if (!Y[i]) break;
else stk.pop_back();
}
}
}
for(int i = 0; i < N; i++) {
int d = min(X[i], Y[i]);
X[i] -= d;
Y[i] -= d;
}
for(int i = 0; i < N; i++) {
res -= Y[i];
}
cout << res;
}| # | 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... | ||||
