제출 #567342

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

kitchen

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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define ll long long
#define mod 1000000007

ofstream fout(".out");
ifstream fin(".in");

int dp[90001], dp2[90001];

signed main() {

    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n, m, k;
    cin >> n >> m >> k;
    int a[n], b[m];
    int x = 0;
    bool bad = 0;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        x += a[i];
        if(a[i] < k)
            bad = 1;
    }
    int sum = 0;
    for(int i = 0; i < m; i++) {
        cin >> b[i];
        sum += b[i];
    }
    if(bad) {
        cout << "Impossible";
        return 0;
    }
    // dp[i] = the maximum number of meals they can prepare in i hours
    dp2[0] = 1;
    for(int i = 0; i < m; i++) {
        for(int j = sum; j >= b[i]; j--) {
            dp2[j] |= dp2[j - b[i]];
            if(dp2[j - b[i]] && dp[j - b[i]] + min(n, b[i]) > dp[j])
                dp[j] = dp[j - b[i]] + min(n, b[i]);
        }
    }
    for(int i = x; i <= sum; i++) {
        if(dp[i] >= n * k) {
            cout << i - x;
            return 0;
        }
    }
    cout << "Impossible";

    return 0;
}

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