Submission #573697

#	Time	Username	Problem	Language	Result	Execution time	Memory
573697		eecs	Uplifting Excursion (BOI22_vault)	C++17	40 / 100	4051 ms	1708 KiB

vault

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

typedef long long ll;

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int m;
    ll L, all = 0;
    cin >> m >> L;
    vector<ll> a(m + 1), b(m + 1);
    for (int i = -m; i <= m; i++) {
        if (i < 0) cin >> *new ll;
        else cin >> a[i], all += i * a[i];
    }
    if (all < L) cout << "impossible\n", exit(0);
    ll ans = a[0];
    for (int i = 1; i <= m; i++) {
        b[i] = min(a[i], L / i);
        ans += b[i], L -= b[i] * i, a[i] -= b[i];
    }
    int lim = m * L;
    vector<int> f(2 * lim + 1, -1e9);
    f[lim] = 0;
    for (int i = 1; i <= m; i++) {
        vector<int> g(2 * lim + 1, -1e9);
        for (int j = -lim; j <= lim; j++) if (f[lim + j] > -1e8) {
            for (int k = 0; k <= a[i] && j + i * k <= lim; k++) {
                g[lim + j + i * k] = max(g[lim + j + i * k], f[lim + j] + k);
            }
            for (int k = 0; k <= b[i] && j - i * k >= -lim; k++) {
                g[lim + j - i * k] = max(g[lim + j - i * k], f[lim + j] - k);
            }
        }
        swap(f, g);
    }
    if (f[L + lim] < -1e8) cout << "impossible\n";
    else cout << ans + f[L + lim] << "\n";
    return 0;
}

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