oj.uz

Submission #1105777

# Submission time Handle Problem Language Result Execution time Memory
1105777 2024-10-27T17:40:02 Z vjudge1 Kitchen (BOI19_kitchen) C++17
29 / 100
 68 ms 3408 KB 
#include <bits/stdc++.h>

int main() {
    std::ios_base::sync_with_stdio(false); 
    std::cin.tie(nullptr);

    int n, m, k;
    std::cin >> n >> m >> k;
    std::vector<int> a(n), b(m);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        std::cin >> b[i];
    }
    int64_t suma = 0;
    for (int i = 0; i < n; i++) {
        suma += a[i];
    }
    int64_t sumb = 0;
    for (int i = 0; i < m; i++) {
        sumb += b[i];
    }
    if (k == 1) {
        std::vector<std::vector<bool>> dp(m + 1, std::vector<bool>(sumb + 1, false));
        dp[0][0] = 1;
        for (int i = 1; i <= m; i++) {
            for (int j = 0; j <= sumb; j++) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j]);
                if (j >= b[i - 1]) {
                    dp[i][j] = max(dp[i][j], dp[i - 1][j - b[i - 1]]);
                }
            }
        }
        for (int j = suma; j <= sumb; j++) {
            if (dp[m][j] == 1) {
                std::cout << j - suma << "\n";
                return 0;
            }
        }
        std::cout << "Impossible\n";
        return 0;
    }
    for (int i = 0; i < n; i++) {
        if (a[i] < k) {
            std::cout << "Impossible\n";
            return 0;
        }
    }
    int64_t ans = LLONG_MAX;
    for (int mask = 0; mask < (1 << m); mask++) {
        std::vector<int> chefs;
        int64_t sum = 0;
        for (int i = 0; i < m; ++i) {
            if (mask & (1 << i)) {
                chefs.push_back(b[i]);
                sum += b[i];
            }
        }
        if (sum < suma) {
            continue;
        }
        std::sort(chefs.begin(), chefs.end());
        /**
        std::vector<int> towers(n), mars(n);
        int ptr = 0;
        int delta = 0;
        for (auto x : chefs) {
            mars[ptr]++;
            if (ptr + x < n) {
                mars[ptr + x]--;
            }
            while (ptr < n && delta + mars[ptr] == k) {
                delta += mars[ptr++];
            }
            if (ptr == n) {
                continue;
            }
        }
        if (ptr == n) {
            ans = std::min(ans, sum - suma);
        }
        **/
        std::vector<int> towers(n);
        for (auto x : chefs) {
            int rem = x;
            for (int i = 0; i < n; i++) {
                if (towers[i] == k) {
                    continue;
                }
                towers[i]++;
                rem--;
                if (rem == 0) {
                    continue;
                }
            }
        }
        bool bad = 0;
        for (int i = 0; i < n; i++) {
            if (towers[i] != k) {
                bad = 1;
            }
        }
        if (bad == 0) {
            ans = std::min(ans, sum - suma);
        }
    }
    if (ans != LLONG_MAX) {
        std::cout << ans << "\n";
        return 0;
    }
    std::cout << "Impossible\n";
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 8 ms 336 KB Output is correct
10 Correct 7 ms 504 KB Output is correct
11 Incorrect 5 ms 336 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2384 KB Output is correct
2 Correct 38 ms 1872 KB Output is correct
3 Correct 39 ms 2128 KB Output is correct
4 Correct 66 ms 3408 KB Output is correct
5 Correct 68 ms 3408 KB Output is correct
6 Correct 30 ms 1616 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 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 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 8 ms 336 KB Output is correct
10 Correct 7 ms 504 KB Output is correct
11 Incorrect 5 ms 336 KB Output isn't correct
12 Halted 0 ms 0 KB -