제출 #595584

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

vault

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
map<ll, ll> dp;
ll border = 2e5 + 10;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll M, L;
    cin >> M >> L;
    for (ll i = -M; i <= M; i++)
    {
        ll A;
        cin >> A;
        
        int c = 1;
        if (i < 0) c = -1;
        //cerr << c << '\n';
        for (int t = c*border; abs(t) <= border; t -= c)
        {
            for (ll k = 1; k <= A; k++) dp[t] = max(dp[t], dp[t - (i * k)] + k);
            
        }
    }
    
    if (dp[L] == 0) cout << "impossible";
    else cout << dp[L];
}

• 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