제출 #745918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
745918		vjudge1	Kitchen (BOI19_kitchen)	C++17	20 / 100	59 ms	29508 KiB

kitchen

#include <bits/stdc++.h>

using namespace std;
using ll = long long int;

const ll mod = 1e9 + 7;

bool lehet[400][100000] = {false};

int main(){
    int n, m, k;
    cin >> n >> m >> k;
    vector<ll> v(n), t(m);
    ll sumv = 0;
    for(auto& i : v){
        cin >> i;
        sumv += i;
    }
    for(auto& i : t){
        cin >> i;
    }
    lehet[0][0] = lehet[0][t[0]] = true;
    for(int i = 1; i < m; ++i){
        for(int j = 0; j < 100000; ++j){
            lehet[i][j] |= lehet[i - 1][j];
            if(j >= t[i]){
                lehet[i][j] |= lehet[i - 1][j - t[i]];
            }
        }
    }
    ll sol = sumv;
    while(!lehet[m -1][sol] && sol < 100000) ++sol;
    if(sol == 100000){
        cout << "Impossible" << endl;
    }
    else{
        cout << sol - sumv << endl;
    }
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 20 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28