Submission #566998

#TimeUsernameProblemLanguageResultExecution timeMemory
566998MrDebooKitchen (BOI19_kitchen)C++17
9 / 100
1087 ms49236 KiB
#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>; bool dp[500][100000]; 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,0,sizeof dp); dp[0][0]=1; for(int i=0;i<m;i++){ for(int w=499;w>=0;w--){ for(int j=100000-b[i];j>=0;j--){ if(dp[w][j])dp[w+1][j+b[i]]=1; } } } 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<=300*m;w++){ if(dp[i][w]){ ans=min(ans,w-sm); break; } } } if(ans==INT_MAX)cout<<"Impossible"; else cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...