제출 #1120767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120767		vjudge1	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	1 ms	508 KiB

vault

#include <bits/stdc++.h>
using namespace std;
int n, q;
long long L;
long long b[100100];
long long a[100100];
long long f[100100];

void solve() {
    cin >> n >> L;
    for(int i = n; i >= 1; i--) {
        cin >> b[i];
    }
    long long ex;
    cin >> ex;
    //L *= -1;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        L += b[i] * i;
        ex += b[i];
        b[i] += a[i];
    }

    long long c = L;
    if(c < 0) {
        cout << "impossible";
        return;
    }
    for(int i = n; i >= 1; i--) {
        long long d = min(c/i, b[i]);
        c -= d * i;
    }
    if(c > 0) {
        cout << "impossible";
        return;
    }
    c = L;
    for(int i = 1; i <= n; i++) {
        long long d = min(c/i, a[i]);
        f[i] = d;
        c -= d * i;
        ex += d;
    }
    for(int i = n; i >= 1; i--) {
        long long d = min(min(c/i, a[i]), b[i] - f[i]);
        f[i] += d;
        c -= d * i;
        ex -= d;
    }

    for(int i = n; i >= 1; i--) {
        long long d = min(c/i,b[i] - f[i]);
        f[i] += d;
        c -= d * i;
        ex -= d;
    }
    if(c == 0) {
        cout << ex << "\n";
    } else {
        cout << "impossible\n";
    }
}
int main() {
    solve();
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10