Submission #164201

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

bool dp[301][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;
    }
    FOR(i, 1, m + 1) {
        int x;
        cin >> x;
        FOR(j, 0, x) dp[i][j] = dp[i - 1][j];
        FOR(j, x, 90001) dp[i][j] = dp[i - 1][j] || dp[i - 1][j - x];
    }

    FOR(i, sm, 90001) if (dp[m][i] >= n * k) return cout << i - sm, 0;
    cout << "Impossible";
    return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 23292 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 3860 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -