제출 #1097287

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1097287		Trisanu_Das	Bikeparking (EGOI24_bikeparking)	C++17	44 / 100	38 ms	5720 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    int x[n], y[n], tot = 0;
    for (int i = 0; i < n; i++) cin >> x[i];
    for (int i = 0; i < n; i++){ 
        cin >> y[i];
        tot += y[i];
    }
    int free = 0, ans = 0, u;
    for (int i = 0; i < n; i++) {
        u = min(free, y[i]);
        free -= u;
        y[i] -= u;
        tot -= u;
        ans += u;
        if (x[i] > y[i]) {
            free += x[i] - y[i];
            x[i] = y[i];
        }
    }
    free = 0;
    for (int i = 0; i < n; i++) {
        tot -= y[i];
        u = min(free, y[i]);
        free -= u;
        y[i] -= u;
        ans += u;
        if (x[i] > tot) {
            free = tot;
            ans -= max(y[i] - (x[i] - tot), 0);
        } else {
            free += x[i];
            ans -= y[i];
        }
    }
    cout << ans << '\n';
}

• Subtask 1: 16 / 16
• Subtask 2: 9 / 9
• Subtask 3: 19 / 19
• Subtask 4: 0 / 24
• Subtask 5: 0 / 32