# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
958141 |
2024-04-05T02:37:34 Z |
ezzzay |
Kitchen (BOI19_kitchen) |
C++14 |
|
1 ms |
348 KB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ff first
#define ss second
const int N=550;
int a[N];
int b[N];
signed main(){
int n,m,k;
cin>>n>>m>>k;
int s=0;
for(int i=1;i<=n;i++){
cin>>a[i];
s+=a[i];
}
for(int i=0;i<m;i++)cin>>b[i];
for(int i=1;i<=n;i++){
if(a[i]<k){
cout<<"IMPOSSIBLE";
return 0;
}
}
int sum=s;
int ans=1e9;
for(int i=0; i<(1<<m); i++){
int cur=0,cnt=0,num=0;
for(int j=0; j<m; j++){
if(i&(1<<j)){
if(num+b[j]>=n){
cnt++;
num=min(num,(num+b[j])%n);
}else{
num+=b[j];
}
cur+=b[j];
}
}
if(cur>=sum&&cnt>=k){
ans=min(ans,cur-sum);
}
}
if(ans==1e9) cout<<"Impossible";
else cout<<ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
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 |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |