Submission #604348

#	Time	Username	Problem	Language	Result	Execution time	Memory
604348		Jomnoi	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	5071 ms	32088 KiB

vault

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

const int MAX_N = 105;
const int MAX_W = 1000005;
const int INF = 1e9 + 7;

long long A[MAX_N], dp[2][MAX_W];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int M;
    long long L;
    cin >> M >> L;

    for(int i = -M; i <= M; i++) {
        cin >> A[i + M];
    }

    for(int i = 0; i < MAX_W; i++) {
        dp[0][i] = -INF;
    }
    dp[0][MAX_W / 2] = 0;

    int j = 1;
    for(int i = -M; i <= M; i++, j ^= 1) {
        int now = j, pre = j ^ 1;
        for(int j = MAX_W - 1; j >= 0; j--) {
            dp[now][j] = dp[pre][j];
            for(int k = 0; k <= A[i + M]; k++) {
                if(j - k * i >= 0 and j - k * i < MAX_W and dp[pre][j - k * i] != -INF) {
                    dp[now][j] = max(dp[now][j], dp[pre][j - k * i] + k);
                }
            }
        }
    }

    if(abs(L) > MAX_W / 2 or dp[j ^ 1][MAX_W / 2 + L] == -INF) {
        cout << "impossible";
    }
    else {
        cout << dp[j ^ 1][MAX_W / 2 + L];
    }
    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