제출 #746272

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
746272		Szil	Kitchen (BOI19_kitchen)	C++14	100 / 100	25 ms	716 KiB

kitchen

#include <bits/stdc++.h>

using ll = long long;
using namespace std;

const int MAXN = 301;

int a[MAXN], b[MAXN], dp[MAXN*MAXN];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, m, k, need = 0; cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        need += a[i];
        if (a[i] < k) {
            cout << "Impossible\n";
            return 0;
        }
    }
    for (int i = 1; i <= m; i++) cin >> b[i];
    fill(dp, dp+MAXN*MAXN, -1);
    dp[0] = 0;
    for (int i = 1; i <= m; i++) {
        for (int s = MAXN*MAXN-1; s >= b[i]; s--) {
            if (dp[s-b[i]] != -1) 
                dp[s] = max(dp[s], dp[s-b[i]] + min(n, b[i]));
        }
    }

    for (int i = need; i < MAXN*MAXN; i++) {
        if (dp[i] >= n*k) {
            cout << i-need << "\n";
            return 0;
        }
    }
    cout << "Impossible\n";
    return 0;
}

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