# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
949953 | 2024-03-20T00:56:59 Z | Darren0724 | Kitchen (BOI19_kitchen) | C++17 | 19 ms | 860 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 860 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |