# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
126275 |
2019-07-07T10:54:16 Z |
miguel |
Kitchen (BOI19_kitchen) |
C++14 |
|
47 ms |
1904 KB |
#pragma optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
#define int ll
#define nmax 305
const ll mod = 1e9 + 7;
int n, m, k, s;
int a[305], b[305], dp[2][1000001];
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
cin>>n>>m>>k;
//if(m<k) return cout<<"Impossible", 0;
for(int i=1; i<=n; i++){
cin>>a[i];
s+=a[i];
if(a[i]<k) return cout<<"Impossible", 0;
}
for(int i=1; i<=m; i++) cin>>b[i];
dp[0][0]=0;
//int cur=0;
for(int i=1; i<=m; i++){
for(int h=0; h<=nmax*nmax; h++){
dp[1][h+b[i]]=max(dp[0][h+b[i]], dp[0][h]+min(b[i], n));
}
//cur+=b[i];
for(int h=0; h<=nmax*nmax; h++) dp[0][h]=dp[1][h];
}
//cout<<"xd";
for(int h=s; h<=nmax*nmax; h++){
//cout<<h<<" "<<dp[0][h]<<endl;
if(dp[0][h]>=n*k) return cout<<h-s, 0;
}
cout<<"Impossible";
}
Compilation message
kitchen.cpp:1:0: warning: ignoring #pragma optimize [-Wunknown-pragmas]
#pragma optimize("Ofast")
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1784 KB |
Output is correct |
2 |
Incorrect |
4 ms |
1784 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1784 KB |
Output is correct |
2 |
Incorrect |
4 ms |
1784 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
47 ms |
1904 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
1764 KB |
Output is correct |
2 |
Correct |
10 ms |
1784 KB |
Output is correct |
3 |
Correct |
10 ms |
1784 KB |
Output is correct |
4 |
Correct |
10 ms |
1784 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
1784 KB |
Output is correct |
2 |
Incorrect |
4 ms |
1784 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |