제출 #849892

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

vault

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

int m;
ll l, a[605];
map<pair<int, ll>, ll> mem;
ll solve(int i, ll s) {
    if (i == 2 * m + 1) {
        if (s == l) return 0;
        return -1e18;
    }
    if (mem.find({i, s}) != mem.end()) {
        return mem[make_pair(i, s)];
    }
    ll ans = -1e18;
    for (int j = 0; j <= a[i]; j++) {
        ans = max(ans, j + solve(i + 1, s + j * (i - m)));
    }
    return mem[make_pair(i, s)] = ans;
}
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin >> m >> l;
    for (int i = 0; i < 2 * m + 1; i++) {
        cin >> a[i];
    }
    ll ans = solve(0, 0);
    if (ans < 0) {
        cout << "impossible\n";
    } else {
        cout << ans << '\n';
    }
    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