제출 #697803

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
697803		Duy_e	Uplifting Excursion (BOI22_vault)	C++14	0 / 100	3 ms	3540 KiB

vault

#include <bits/stdc++.h>
#define ll long long
#define pii pair <ll, ll>
#define st first
#define nd second
#define rep(i, n, m) for (ll i = (n); i <= (m); i ++)
#define rrep(i, n, m) for (ll i = (n); i >= (m); i --)
using namespace std;

const long long INF = 1e18;
const long long N = 2e5;

ll n, m, a[N], l;

ll buff;
ll dp[N];

void maximize(ll &x, ll y) {
    if (x < y) x = y;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> m >> l;
    ll tot = 0;
    rep(i, 1, 2 * m + 1) {
        cin >> a[i];
        if (i > m) tot += a[i] * (i - m - 1);
    }

    if (tot < l) return cout << "impossible\n", 0;

    buff = abs(l);

    rep(i, 0, N - 1) dp[i] = -1e18;

    dp[buff] = 0;

    rep(i, 1, 2 * m + 1) rep(k, 1, a[i]) {
        ll val = i - m - 1;
        rrep(j, buff, -buff) {
            if (j - val >= 0) {
                maximize(dp[j + buff], dp[j - val + buff] + 1);
            }
        }
    }

    if (dp[l + buff] < 0) cout << "impossible\n"; else
    cout << dp[l + buff];

    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