#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define pb push_back
#define all(v) v.begin(),v.end()
const ll M=90000+10;
const ll inf=1e18+10;
ll n,m,k,sum,b[M];
bitset<2000>dp[2][2000];
int main(){
ios_base::sync_with_stdio(0),cin.tie(0);
cin>>n>>m>>k;
for(int i=0;i<n;i++){
ll x;
cin>>x;
if(x<k){
cout<<"impossible";
return 0;
}
sum+=x;
}
ll sb=0,sb1=0;
for(int i=0;i<m;i++)
cin>>b[i],sb+=b[i],sb1+=min(n,b[i]);
sb++;
sb1++;
dp[0][0][0]=1;
for(int i=0;i<m;i++){
for(int j=0;j<sb;j++){
for(int ii=0;ii<=n*k;ii++){
if(dp[0][j][ii]){
dp[1][j+b[i]][min(n*k,ii+min(b[i],n))]=1;
}
}
}
for(int j=0;j<=sum;j++){
for(int ii=0;ii<=n*k;ii++){
if(dp[1][j][ii])
dp[0][j][ii]=1,dp[1][j][ii]=0;
}
}
}
for(ll i=sum;i<sb;i++){
if(dp[0][i][n*k]){
cout<<i-sum;
return 0;
}
}
cout<<"impossible";
}
# |
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 |
Runtime error |
2 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
56 ms |
912 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 |
- |