oj.uz

Submission #164205

# Submission time Handle Problem Language Result Execution time Memory
164205 2019-11-18T14:51:13 Z dolphingarlic Kitchen (BOI19_kitchen) C++14
0 / 100
 25 ms 892 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int dp[90001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, k, sm = 0;
    cin >> n >> m >> k;
    if (m < k) return cout << "Impossible", 0;
    FOR(i, 0, n) {
        int a;
        cin >> a;
        if (a < k) return cout << "Impossible", 0;
        sm += a;
    }

    memset(dp, -1, sizeof(dp));
    dp[0] = 0;
    FOR(i, 1, m + 1) {
        int x;
        cin >> x;
        for (int j = 90000; ~j; j--) if (dp[j - x] != -1) {
            dp[j] = max(dp[j], dp[j - x] + min(x, n));
        }
    }

    FOR(i, sm, 90001) if (dp[i] >= n * k) return cout << i - sm, 0;
    cout << "Impossible";
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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