제출 #579705

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

vault

#include <bits/stdc++.h>

using namespace std;

#define int int64_t

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

    int n, target; cin >> n >> target;

    vector<int> coins(2*n+1);

    for (int i = 0; i<2*n+1; i++) cin >> coins[i];


    vector<int> coinsEXPL;

    for (int i = 0; i<2*n+1; i++) {
        for (int j = 0; j<coins[i]; j++) coinsEXPL.push_back(i-n);
    }

    unordered_map<int, int> dp;
    dp[0] = 0;

    for (int i: coinsEXPL) {
        unordered_map<int, int> newDP = dp;
        for (auto j: dp) {
            cerr << j.first << " " << j.second << "\n";
            newDP[j.first+i] = max(j.second+1, newDP[j.first+i]);
        }
        dp = newDP;
    }


    if (dp.count(target)) cout << dp[target] << "\n";
    else cout << "impossible\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