Submission #721831

#	Time	Username	Problem	Language	Result	Execution time	Memory
721831		OttincaM	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	5058 ms	3228 KiB

vault

#include <iostream>
#include <vector>
#include "stdio.h"
#include <map>

using namespace std;
// #define int long long

long long const LLINF = 2e9 + 1;
int const N = 4000000;
int const ZER = 1000000;

signed main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    #ifdef WTF
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
        freopen("error.txt", "w", stderr);
    #endif


    int m, l; cin >> m >> l;
    vector <int> a(2 * m + 2), x, y, z;
    for(int i = 1; i <= 2 * m + 1; i ++){
         cin >> a[i];
         int K = a[i];
         while(K --){
            if(i - 1 - m > 0){
                x.push_back(i - 1 - m);
            } else if(i - 1 - m < 0){
                y.push_back(i - 1 - m);
            } else {
                z.push_back(i - 1 - m);
            }
         }
    }

    map <int, int> dp;
    dp[0] = (int)z.size();

    for(int t: x){
        vector <int> id;
        for(auto p: dp) id.push_back(p.first);
        // cout << id.size() << "\n";
        for(int i = id.size() - 1; i >= 0; i --){
            dp[id[i] + t] = max(dp[id[i] + t], dp[id[i]] + 1);
            // cout << id[i] + t << " " << dp[id[i] + t] << "\n";
        }

    }

    for(int t: y){
        vector <int> id;
        for(auto p: dp) id.push_back(p.first);

        for(int i = 0; i < id.size(); i ++){
            dp[id[i] + t] = max(dp[id[i] + t], dp[id[i]] + 1);
        }
    }

    if(dp.find(l) == dp.end()){
        cout << "impossible\n";
    } else {
        cout << dp[l] << "\n";
    }
    return 0;
}

Compilation message (stderr)

vault.cpp: In function 'int main()':
vault.cpp:56:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for(int i = 0; i < id.size(); i ++){
      |                        ~~^~~~~~~~~~~

• 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