제출 #1245842

#제출 시각아이디문제언어결과실행 시간메모리
1245842AMel0nBikeparking (EGOI24_bikeparking)C++20
25 / 100
26 ms4936 KiB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define FOR(i,N) for(ll i = 0; i < N; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second


signed main() {
    cin.tie(0); ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    vector<ll> park(N), user(N);
    FOR(i, N) cin >> park[i];
    FOR(i, N) cin >> user[i];
    ll u = N-1;
    ll res = 0;
    for(ll p = N-2; p >= 0; p--) {
        while(p < u) {
            if (!park[p]) break;
            if (!user[u]) {u--; continue;}
            ll delta = min(park[p], user[u]);
            park[p] -= delta;
            user[u] -= delta;
            res += delta;
        }
    }
    FOR(i, N) res -= max(0ll, user[i] - park[i]);
    cout << res << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...