제출 #1105868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105868		vjudge1	Kitchen (BOI19_kitchen)	C++17	29 / 100	117 ms	98424 KiB

kitchen

#include <bits/stdc++.h>

int main() {
    std::ios_base::sync_with_stdio(false); 
    std::cin.tie(nullptr);

    int n, m, k;
    std::cin >> n >> m >> k;
    std::vector<int> a(n), b(m);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        std::cin >> b[i];
    }
    int64_t suma = 0;
    int64_t sumb = 0;
    for (int i = 0; i < n; i++) {
        suma += a[i];
    }
    for (int i = 0; i < m; i++) {
        sumb += b[i];
    }
    if (m < k || sumb < suma) {
        std::cout << "Impossible\n";
        return 0;
    }
    for (int i = 0; i < n; i++) {
        if (a[i] < k) {
            std::cout << "Impossible\n";
            return 0;
        }
    }
    std::vector<std::vector<int>> dp(m + 1, std::vector<int>(sumb + 1));
    for (int i = 0; i <= m; i++) {
        for (int j = 0; j <= sumb; j++) {
            dp[i][j] = -1;
        }
    }
    dp[0][0] = 0;
    for (int i = 0; i < m; i++) {
        for (int j = 0; j <= sumb; j++) {
            if (dp[i][j] == -1) {
                continue;
            }
            dp[i + 1][j] = dp[i][j];
            if (j + b[i] <= sumb) {
                dp[i + 1][j + b[i]] = std::max(dp[i + 1][j + b[i]], dp[i][j] + std::min(b[i], n));
            }
        }
    }
    for (int j = suma; j <= sumb; j++) {
        if (dp[m][j] >= n * k) {
            std::cout << j - suma << "\n";
            return 0;
        }
    }
    std::cout << "Impossible\n";
    return 0;
}

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