oj.uz

Submission #651018

# Submission time Handle Problem Language Result Execution time Memory
651018 2022-10-16T13:33:18 Z dooompy Kitchen (BOI19_kitchen) C++17
0 / 100
 61 ms 119704 KB 
#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

int a[305], b[305];

int dp[100005][305]; //

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n, m, k; cin >> n >> m >> k;

    int totala = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        totala += a[i];
    }
    for (int i = 1; i <= m; i++) cin >> b[i];

    fill(&dp[0][0], &dp[0][0] + sizeof(dp) / sizeof(dp[0][0]), -1);
    dp[0][0] = 0;

    int sum = 0;
    for (int i = 1; i <= m; i++) {
        sum += b[i];
        for (int j = 0; j <= sum; j++) {
            if (dp[i-1][j] < 0) continue;
            dp[i][j] = dp[i-1][j];
            dp[i][j + b[i]] = max(dp[i][j + b[i]], dp[i-1][j] + min(n, b[i]));
        }
    }

    for (int i = totala; i <= 100000; i++) {
        if (dp[m][i] >= n * k) {
            cout << i - totala;
            return 0;
        }
    }

    cout << "Impossible";
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 119604 KB Output is correct
2 Correct 51 ms 119576 KB Output is correct
3 Correct 47 ms 119668 KB Output is correct
4 Correct 48 ms 119656 KB Output is correct
5 Correct 47 ms 119704 KB Output is correct
6 Correct 61 ms 119668 KB Output is correct
7 Incorrect 54 ms 119668 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 119604 KB Output is correct
2 Correct 51 ms 119576 KB Output is correct
3 Correct 47 ms 119668 KB Output is correct
4 Correct 48 ms 119656 KB Output is correct
5 Correct 47 ms 119704 KB Output is correct
6 Correct 61 ms 119668 KB Output is correct
7 Incorrect 54 ms 119668 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 119604 KB Output is correct
2 Correct 51 ms 119576 KB Output is correct
3 Correct 47 ms 119668 KB Output is correct
4 Correct 48 ms 119656 KB Output is correct
5 Correct 47 ms 119704 KB Output is correct
6 Correct 61 ms 119668 KB Output is correct
7 Incorrect 54 ms 119668 KB Output isn't correct
8 Halted 0 ms 0 KB -