oj.uz

Submission #991220

# Submission time Handle Problem Language Result Execution time Memory
991220 2024-06-01T15:19:54 Z VMaksimoski008 Kitchen (BOI19_kitchen) C++17
72 / 100
 1000 ms 113752 KB 
#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;

bool dp[41][41*41][41*41];

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];
        //cout << sum << '\n';

        for(int s=1; s<(1<<(m+1)); s++) {
            if(s & 1) continue;
            if(__builtin_popcount(s) < k) continue;
            
            int sum2=0, area=0;

            for(int i=1; i<=m; i++) {
                if(s & (1 << i)) {
                    sum2 += B[i];
                    if(area < n * k) area += min(B[i], n);
                }
            }

            if(sum2 >= sum && area >= n * k) ans = min(ans, sum2 - sum);
        }

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

    ll sumA = 0, sumB = 0;
    for(int i=1; i<=n; i++) sumA += A[i];
    for(int i=1; i<=m; i++) sumB += B[i];

    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;

    for(int i=1; i<=m; i++) {
        for(int j=0; j<=sumB; j++) {
            for(int x=0; x<=max((ll)n*k, sumB); x++) {
                //cout << i << " " << j << " " << x << '\n';
                dp[i][j][x] = dp[i-1][j][x];
                if(j >= B[i] && x >= min(n, B[i]) && dp[i-1][j-B[i]][x-min(n, B[i])]) dp[i][j][x] = 1;
            }
        }
    }

    for(int j=sumA; j<=sumB; j++) {
        for(int x=n*k; x<=sumB; x++) {
            if(dp[m][j][x]) {
                cout << j - sumA << '\n';
                return 0;
            }
        }
    }

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 1 ms 356 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 0 ms 476 KB Output is correct
8 Correct 0 ms 352 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 1 ms 356 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 0 ms 476 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 360 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 2 ms 480 KB Output is correct
13 Correct 1 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 484 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 113604 KB Output is correct
2 Correct 83 ms 113744 KB Output is correct
3 Correct 132 ms 113752 KB Output is correct
4 Correct 142 ms 113748 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 1 ms 356 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 0 ms 476 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 360 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 2 ms 480 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 1 ms 484 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 124 ms 113604 KB Output is correct
21 Correct 83 ms 113744 KB Output is correct
22 Correct 132 ms 113752 KB Output is correct
23 Correct 142 ms 113748 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Execution timed out 1065 ms 113724 KB Time limit exceeded
26 Halted 0 ms 0 KB -