# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
949953 | Darren0724 | Kitchen (BOI19_kitchen) | C++17 | 19 ms | 860 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
#define no cout<<"Impossible"<<endl;return 0;
const int N=200005;
const int INF=1e18;
int32_t main() {
LCBorz;
int n,m,k;cin>>n>>m>>k;
if(m<k){
no;
}
vector<int> a(n),b(m);
int total=0,ta=0,tb=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<k){
no;
}
total+=a[i];
}
for(int i=0;i<m;i++){
cin>>b[i];
ta+=b[i];
}
vector dp(ta+1,(int)0);
for(int i=0;i<m;i++){
for(int j=ta;j>=b[i];j--){
int tmp=min(b[i],n);
dp[j]=max(dp[j],dp[j-b[i]]+tmp);
}
}
int ans=-1;
for(int i=total;i<=ta;i++){
if(dp[i]>=k*n){
ans=i;break;
}
}
if(ans==-1){
no;
}
else{
cout<<ans-total<<endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |