제출 #721850

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

vault

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

int main () {
    ios::sync_with_stdio(0); cin.tie(0);
    int M, L;
    cin >> M >> L;
    map<int, int> sums;
    sums[0] = 0;
    vector<int> a;
    for (int i = -M, x; i <= M; i++) {
        cin >> x;
        for (int j = 0; j < x; j++) {
            a.push_back(i);
        }
    }
    int N = (int)a.size();
    for (int i = 0; i < N; i++) {
        map<int, int> curr;
        for (auto &[k, v]: sums) {
            curr[a[i] + k] = max(curr[a[i] + k], v + 1);
        }
        for (auto &[k, v]: curr) {
            sums[k] = max(sums[k], v);
        }
    }
    if (sums.count(L)) {
        cout << sums[L] << '\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