제출 #567056

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
567056		MrDeboo	Kitchen (BOI19_kitchen)	C++17	52 / 100	1098 ms	106444 KiB

kitchen

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
int dp[301][90001];
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    int a[n];
    int b[m];
    for(auto &i:a)cin>>i;
    for(auto &i:b)cin>>i;
    if(m<k){cout<<"Impossible";return 0;}
    for(int i=0;i<n;i++){
        if(a[i]<k){cout<<"Impossible";return 0;}
    }
    memset(dp,-1,sizeof dp);
    dp[0][0]=0;
    for(int i=0;i<m;i++){
        for(int w=299;w>=0;w--){
            for(int j=90000-b[i];j>=0;j--){
                if(dp[w][j]!=-1)dp[w+1][j+b[i]]=max(dp[w+1][j+b[i]],dp[w][j]+min(b[i],n));
            }
        }
    }
    int sm=0;
    int ans=INT_MAX;
    for(auto &i:a)sm+=i;
    for(int i=k;i<=m;i++){
        for(int w=sm;w<=90000;w++){
            if(dp[i][w]>=n*k){
                ans=min(ans,w-sm);
            }
        }
    }
    if(ans==INT_MAX)cout<<"Impossible";
    else cout<<ans;
}

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