Submission #1352524

#	Time	Username	Problem	Language	Result	Execution time	Memory
1352524		vahagng	Uplifting Excursion (BOI22_vault)	C++20	0 / 100	5089 ms	3612 KiB

vault

#include <bits/stdc++.h>
using namespace std;

const int N = 3e5;

long long n, l;
long long a[N];

int main(){
    cin >> n >> l;
    for(int i = 0; i < 2*n + 1; i++){
        cin >> a[i];
    }
    map<int,int> dp;
    dp[0] = 0;
    for(int i = 0; i < 2*n + 1; i++){
        map<int,int> dp1 = dp;
        for(int j = 0; j < a[i]; j++){
            for(auto z : dp){
                dp1[z.first + i - n] = max(dp1[z.first + i - n], dp[z.first] + 1);
            }
            dp = dp1;
        }
    }
    // for(auto i : dp){
    //     cerr << i.first << ' ' << i.second << endl;
    // }
    if(dp[l] == 0){
        cout << "impossible\n";
        return 0;
    }
    cout << dp[l] << endl;
}

• 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