Submission #1087324

#	Time	Username	Problem	Language	Result	Execution time	Memory
1087324		steveonalex	Kitchen (BOI19_kitchen)	C++17	0 / 100	37 ms	860 KiB

kitchen

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }



int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n, m, k; cin >> n >> m >> k;
    vector<int> a(n);
    for(int i= 0; i<n; ++i) cin >> a[i];

    vector<int> b(m);
    for(int i = 0; i<m; ++i) cin >> b[i];

    if (*min_element(ALL(a)) < k){
        cout << "impossible\n";
        return 0;
    }
    int barrier = n * k;
    int sumA = 0, sumB = 0;
    for(int i: a) sumA += i;
    for(int i: b) sumB += i;

    int dp[2][sumB + 1];
    memset(dp, -1, sizeof dp);
    dp[0][0] = 0;
    int ans = 1e9;
    for(int i: b){
        for(int j = 0; j <= sumB; ++j) if (dp[0][j] != -1){
            maximize(dp[1][j + i], dp[0][j] + min(i, n));
        }
        for(int j = 0; j <= sumB; ++j){
            dp[0][j] = dp[1][j];
            dp[1][j] = -1;
            if (dp[0][j] >= barrier && j >= sumA)
                minimize(ans, j - sumA);
        }
    }

    if (ans == 1e9) cout << "impossible\n";
    else cout << ans << "\n";
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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