Submission #566978

#	Time	Username	Problem	Language	Result	Execution time	Memory
566978		MrDeboo	Kitchen (BOI19_kitchen)	C++17	20 / 100	45 ms	26884 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>;
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;}
    }
    bool dp[m+1][300*m+1];
    memset(dp,0,sizeof dp);
    dp[0][0]=1;
    for(int i=0;i<m;i++){
        for(int j=300*m-b[i];j>=0;j--){
            if(dp[0][j])dp[0][j+b[i]]=1;
        }
    }
    int sm=0;
    int ans=INT_MAX;
    for(auto &i:a)sm+=i;
    for(int i=0;i<=m;i++){
        for(int w=sm;w<=300*m;w++){
            if(dp[i][w]){
                ans=min(ans,w-sm);
                break;
            }
        }
    }
    if(ans==INT_MAX)cout<<"Impossible";
    else cout<<ans;
}

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