제출 #1241544

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241544		yassia	Kitchen (BOI19_kitchen)	C++20	0 / 100	1100 ms	136264 KiB

kitchen

#ifndef local
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
#define int ll
using pii = pair<int, int>;
using pll = pair<ll,ll>;
using str = string;
using ld = long double;
using hash_map =gp_hash_table<int, int>;
using hash_set= gp_hash_table <int, null_type>;
auto sd = std::chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(sd);
typedef tree<ll, null_type, less<>, rb_tree_tag,
        tree_order_statistics_node_update> ord_set;
const ll maxn = 3e5+8;
const ll inf = 1e18;
void solve1() {
    ll n;
    cin >> n; ll m, k;cin>>m>>k;
    vector<ll> a(n);
    ll sum_ai = 0;
    bool impossible = false;
    if (m<k) impossible=true;
    for (int i =0; i<n ;i++){
        cin>>a[i];
        sum_ai += a[i];
    }
    vector<ll>b(m);
    ll sum=0;
    for (int i =0; i < m; i++){
        cin>>b[i];
        sum += b[i];
    }
    if (impossible){
        cout<<"Impossible\n";
        return;
    }
    vector<vector<ll>> dp(m+1, vector<ll>(sum+1, inf));
    dp[0][0] = n*k;
    ll a1= sum_ai - n*k;
    if (a1 < 0){
        cout<<"Impossible\n";
        return;
    }
    for (int i = 1; i <= m; i++){
        for (int j = 0; j <= sum; j++){
            if (dp[i-1][j]==inf){
                continue;
            }
            dp[i][j] = min(dp[i][j], dp[i-1][j]);
            for (int w_ = 0ll; w_ <= b[i-1]; w_++){
                ll ost = min(dp[i-1][j],min(n,b[i-1]-w_));
                ll w1 = b[i-1] - ost;
                if (j+w1 > sum) {
                    continue;
                }
                dp[i][j+w1] = min(dp[i][j+w1], dp[i-1][j]-ost);
            }
        }
    }
    for (int j = 0; j <= sum; j++){
        if (dp[m][j]==0 && j >= a1){
            cout<<j-a1<<endl;
            return;
        }
    }
    cout<<"Impossible\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef local
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    int t1 = 1;
    while (t1) solve1(), t1--;

#ifdef local
    printf_s("\n%.5f s", (double) clock() / CLOCKS_PER_SEC);
#endif
}

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