#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];
}
tb=(k==1?1:k*n);
vector dp(ta+1,vector(tb+1,0));
dp[0][0]=1;
for(int i=0;i<m;i++){
for(int j=ta;j>=b[i];j--){
int tmp=min(b[i],n);
for(int j1=tb;j1>=0;j1--){
dp[j][min(j1+tmp,tb)]|=dp[j-b[i]][j1];
}
}
}
int ans=-1;
for(int i=(k==1?1:total);i<=ta;i++){
for(int j=k*n;ans==-1&&j<=tb;j++){
if(dp[i][j]){
ans=i;break;
}
}
}
if(ans==-1){
no;
}
else{
cout<<ans-total<<endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
49 ms |
3928 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
4440 KB |
Output is correct |
2 |
Correct |
19 ms |
2652 KB |
Output is correct |
3 |
Correct |
26 ms |
3676 KB |
Output is correct |
4 |
Correct |
66 ms |
9052 KB |
Output is correct |
5 |
Correct |
1 ms |
508 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |