Submission #1246472

#	Time	Username	Problem	Language	Result	Execution time	Memory
1246472		adam17	Uplifting Excursion (BOI22_vault)	C++20	0 / 100	2 ms	328 KiB

vault

#include <iostream>
#include <vector>
using namespace std;
#define ll long long

ll M, L, N, NN, MM, NP;
vector<ll> A;
vector<ll> DP;

int main() {
    cin >> M >> L;
    MM = 2 * M + 1;
    A.resize(MM);
    N = 0;
    NP = 0;
    for (ll i = 0; i < MM; i++) {
        cin >> A[i];
        if (i > M) {
            NP += abs(i - M) * A[i];
        } else {
            N += abs(i - M) * A[i];
        }
    }
    NN = N + NP + 1;
    DP.resize(NN);
    for (ll i = 0; i < NN; i++) {
        DP[i] = -1000000000000000;
    }
    DP[N] = 0;
    for (ll i = 0; i < MM; i++) {
        ll x = i - M;
        for (ll _ = 0; _ < A[i]; _++) {
            if (x >= 0) {
                for (ll j = NN - 1; j >= x; j--) {
                    DP[j] = max(DP[j], DP[j - x] + 1);
                }
            } else {
                for (ll j = 0; j < NN + x; j++) {
                    DP[j] = max(DP[j], DP[j - x] + 1);
                }
            }
        }
    }
    if ((L < N) || (L >= NN)) {
        cout << "impossible\n";
    } else if (DP[L + N] < 0) {
        cout << "impossible\n";
    } else {
        cout << DP[L + N] << endl;
    }
    return 0;
}

• 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