제출 #942124

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942124		phoenix0423	Kitchen (BOI19_kitchen)	C++17	21 / 100	44 ms	1116 KiB

kitchen

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
#define lowbit(x) x&-x
const int maxn = 1e5 + 5;
const int INF = 1e9 + 7;

signed main(void){
    fastio;
    int n, m, k;
    cin>>n>>m>>k;
    vector<int> a(n), b(m);
    for(int i = 0; i < n; i++) cin>>a[i];
    for(int i = 0; i < m; i++) cin>>b[i];
    for(int i = 0; i < n; i++){
        if(a[i] < k){
            cout<<"Impossible\n";
            return 0;
        }
    }
    vector<int> dp(maxn);
    for(int i = 0; i < m; i++){
        for(int j = maxn - 1; j >= b[i]; j--){
            dp[j] = max(dp[j], dp[j - b[i]] + min(n, b[i]));
        }
    }
    int ttl = accumulate(a.begin(), a.end(), 0);
    for(int i = ttl; i < maxn; i++){
        if(dp[i] >= n * k){
            cout<<i - ttl<<"\n";
            return 0;
        }
    }
    cout<<"Impossible\n";
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 21 / 21
• Subtask 5: 0 / 28