Submission #519730

#	Time	Username	Problem	Language	Result	Execution time	Memory
519730		K4YAN	Kitchen (BOI19_kitchen)	C++17	100 / 100	36 ms	1640 KiB

kitchen

//Be Name Khoda

#include<bits/stdc++.h>
#pragma GCC optmize("Ofast,unroll-loops")
#pragma GCC target ("avx2,tune=native")

using namespace std;

#define ll long long
#define ld long double
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define plll pair<pll, ll>

const ll mxn = 316;
ll n, m, k, q, w;
ll dp[mxn * mxn], mx[mxn * mxn];
vector<ll> a, b;

void input() {

    cin >> n >> m >> k;
    for(int i = 0; i < n; i++) {
        cin >> q;
        a.push_back(q);
        w += q;
    }
    for(int i = 0; i < m; i++) {
        cin >> q;
        b.push_back(q);
    }

}

void solve() {

    if(m < k) {
        cout << "Impossible\n";
        return;
    }
    for(auto u : a) {
        if(u < k) {
            cout << "Impossible\n";
            return;
        }
    }
    dp[0] = 1;
    for(auto u : b) {
        for(int i = mxn * mxn - 1; i > u - 1; i--) {
            if(dp[i - u]) {
                dp[i] = 1;
                mx[i] = max(mx[i], mx[i - u] + min(n, u));
            }
        }
    }
    for(int i = w; i < mxn * mxn; i++) {
        if(mx[i] < n * k) continue;
        cout << i - w << endl;
        return;
    }
    cout << "Impossible\n";
    return;

}

int main() {

    ios::sync_with_stdio(false); cin.tie(NULL);

    input(), solve();   

    return 0;

}

Compilation message (stderr)

kitchen.cpp:4: warning: ignoring '#pragma GCC optmize' [-Wunknown-pragmas]
    4 | #pragma GCC optmize("Ofast,unroll-loops")
      |

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