oj.uz

Submission #164211

# Submission time Handle Problem Language Result Execution time Memory
164211 2019-11-18T14:54:43 Z dolphingarlic Kitchen (BOI19_kitchen) C++14
100 / 100
 35 ms 764 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 - x; ~j; j--) if (~dp[j]) {
            dp[j + x] = max(dp[j + x], dp[j] + min(x, n));
        }
    }

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 3 ms 636 KB Output is correct
3 Correct 3 ms 764 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 632 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 3 ms 636 KB Output is correct
3 Correct 3 ms 764 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 4 ms 760 KB Output is correct
10 Correct 4 ms 760 KB Output is correct
11 Correct 4 ms 760 KB Output is correct
12 Correct 4 ms 632 KB Output is correct
13 Correct 4 ms 760 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 632 KB Output is correct
2 Correct 23 ms 632 KB Output is correct
3 Correct 32 ms 632 KB Output is correct
4 Correct 34 ms 740 KB Output is correct
5 Correct 33 ms 632 KB Output is correct
6 Correct 21 ms 760 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 632 KB Output is correct
2 Correct 11 ms 680 KB Output is correct
3 Correct 6 ms 764 KB Output is correct
4 Correct 6 ms 760 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 3 ms 636 KB Output is correct
3 Correct 3 ms 764 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 4 ms 760 KB Output is correct
10 Correct 4 ms 760 KB Output is correct
11 Correct 4 ms 760 KB Output is correct
12 Correct 4 ms 632 KB Output is correct
13 Correct 4 ms 760 KB Output is correct
14 Correct 27 ms 632 KB Output is correct
15 Correct 23 ms 632 KB Output is correct
16 Correct 32 ms 632 KB Output is correct
17 Correct 34 ms 740 KB Output is correct
18 Correct 33 ms 632 KB Output is correct
19 Correct 21 ms 760 KB Output is correct
20 Correct 6 ms 632 KB Output is correct
21 Correct 11 ms 680 KB Output is correct
22 Correct 6 ms 764 KB Output is correct
23 Correct 6 ms 760 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 20 ms 760 KB Output is correct
26 Correct 25 ms 760 KB Output is correct
27 Correct 17 ms 632 KB Output is correct
28 Correct 27 ms 632 KB Output is correct
29 Correct 28 ms 636 KB Output is correct
30 Correct 35 ms 760 KB Output is correct