oj.uz

Submission #991125

# Submission time Handle Problem Language Result Execution time Memory
991125 2024-06-01T10:38:58 Z VMaksimoski008 Kitchen (BOI19_kitchen) C++17
0 / 100
 34 ms 624 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;

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];

        bool dp[2][maxn+1];
        memset(dp, 0, sizeof(dp));
        dp[0][0] = 1;

        for(int i=1; i<=m; i++) {
            for(int j=0; j<=maxn; j++) {
                dp[1][j] = dp[0][j];
                if(B[i] <= j && dp[0][j-B[i]]) dp[1][j] = 1;  
            }

            for(int j=0; j<=maxn; j++) {
                dp[0][j] = dp[1][j];
                dp[1][j] = 0;
            }
        }

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

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

    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Incorrect 0 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Incorrect 0 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 600 KB Output is correct
2 Correct 25 ms 604 KB Output is correct
3 Correct 31 ms 624 KB Output is correct
4 Correct 31 ms 604 KB Output is correct
5 Incorrect 34 ms 604 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Incorrect 0 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -