Submission #991193

#	Time	Username	Problem	Language	Result	Execution time	Memory
991193		VMaksimoski008	Kitchen (BOI19_kitchen)	C++17	20 / 100	2 ms	472 KiB

kitchen

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n, m, k;
    cin >> n >> m >> k;

    vector<int> A(n+1), B(m+1);
    for(int i=1; i<=n; i++) cin >> A[i];
    for(int i=1; i<=m; i++) cin >> B[i];
    sort(A.begin() + 1, A.end());
    sort(B.begin() + 1, B.end());

    if(A[1] < k || m < k) {
        cout << "Impossible\n";
        return 0;
    }

    if(k == 1) {
        ll sum = 0;
        for(int i=1; i<=n; i++) sum += A[i];

        bitset<maxn> bs;
        bs[0] = 1;
        
        for(int i=1; i<=m; i++) bs |= (bs << B[i]);

        for(int i=sum; i<=300*300; i++) {
            if(bs[i]) {
                cout << i - sum << '\n';
                return 0;
            }
        }

        cout << "Impossible\n";
        return 0;
    }

    if(m <= 20) {
        ll ans = 1e18;
        ll sum = 0;
        for(int i=1; i<=n; i++) sum += A[i];

        for(int s=1; s<(1<<(m+1)); s++) {
            if(__builtin_popcount(s) < k) continue;

            int cnt=0, sum2=0, sum3 = 0;
            for(int i=1; i<=m; i++) {
                if(s & (1 << i)) {
                    sum2 += B[i];
                    sum3 += B[i];
                    if(sum2 >= k) {
                        cnt++;
                        sum2 -= k;
                    }
                }
            }

            if(sum2 >= k) cnt++;

            if(cnt < n) continue;
            if(sum3 >= sum) ans = min(ans, sum3 - sum);
        }

        if(ans == 1e18) cout << "Impossible\n";
        else cout << ans << '\n';
        return 0;
    }

    return 0;
}

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