제출 #1005468

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

kitchen

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
int n, m, k, res;
int s1, s2, s3, s4, s5, s6, s7, l;
int dp[100001];
int b[301];
void test(){
    for(int i = 1; i <= m; i++){
        for(int j = s4 - b[i]; j >= 0; --j)
        if(dp[j] != inf)
        dp[j + b[i]] = max(dp[j + b[i]], dp[j] + min(b[i], n));
        }
        s3 = inf;
        for(int j = s2;j <= s4; j++)
            if(dp[j] >= n * k)
            s3 = min(s3, j - s2);
}
void solve(){
    cin >> n >> m >> k;
     s7 = inf;
    for(int i = 1; i <= n; i++){
        cin >> l;
        s2 += l;
        s7 = min(s7, l);
    }
    for(int i = 1; i <= m; i++){
            cin>>b[i];
            s4 += b[i];
    }
    for(int i = 0;i <= s4; i++)
    dp[i] = -1e18;
    if(s7 < k){
        cout<<"Impossible";
        exit(0);
    }
    dp[0] = 0;
    test();
    if(s3 != inf) cout << s3;
    else cout << "Impossible";
}
signed main(){
    solve();
}

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