oj.uz

답안 #1105771

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105771 2024-10-27T17:10:48 Z vjudge1 Kitchen (BOI19_kitchen) C++17
20 / 100
 69 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 sumb = 0;
    for (int i = 0; i < m; i++) {
        sumb += b[i];
    }
    if (k == 1) {
        int64_t suma = 0;
        for (int i = 0; i < n; i++) {
            suma += a[i];
        }
        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;
    }
    assert(false);
    return 0;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 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 Runtime error 1 ms 592 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 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 Runtime error 1 ms 592 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 2384 KB Output is correct
2 Correct 53 ms 1872 KB Output is correct
3 Correct 40 ms 2128 KB Output is correct
4 Correct 69 ms 3408 KB Output is correct
5 Correct 68 ms 3408 KB Output is correct
6 Correct 31 ms 1616 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 592 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 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 Runtime error 1 ms 592 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -