Submission #595564

#	Time	Username	Problem	Language	Result	Execution time	Memory
595564		ThegeekKnight16	Uplifting Excursion (BOI22_vault)	C++14	0 / 100	5040 ms	524288 KiB

vault

#include <bits/stdc++.h>
using namespace std;
set<pair<long long int, long long int> > Valores;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long long int M, L;
    cin >> M >> L; Valores.insert(make_pair(0LL, 0LL));
    for (long long int i = -M; i <= M; i++)
    {
        long long int A;
        cin >> A;
        set<pair<long long int, long long int> > Novo;
        for (auto val : Valores)
        {
            for (long long int k = 1; k <= A; k++) Novo.insert(make_pair(val.first + k*i, val.second + k));
        }
        
        for (auto newVal : Novo) Valores.insert(newVal);
    }
    
    long long int resp = -1;
    for (auto val : Valores)
    {
        if (val.first == L) resp = max(resp, val.second);
    }
    if (resp == -1) cout << "impossible";
    else cout << resp;
}

• 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