oj.uz

Submission #136449

# Submission time Handle Problem Language Result Execution time Memory
136449 2019-07-25T10:23:01 Z popovicirobert Kitchen (BOI19_kitchen) C++14
100 / 100
 15 ms 760 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44


/*const int MOD = (int) 1e9 + 7;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}*/

/*int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}*/

using namespace std;

const int INF = 2e9;
const int MAXN = 300;

int a[MAXN + 1], b[MAXN + 1];
int dp[MAXN * MAXN + 1];

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, j, n, m, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m >> k;

    int suma = 0;
    for(i = 1; i <= n; i++) {
        cin >> a[i];
        if(a[i] < k) {
            cout << "Impossible";
            return 0;
        }
        suma += a[i];
    }

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

    fill(dp, dp + sumb + 1, -INF);
    dp[0] = 0;

    for(i = 1; i <= m; i++) {
        int mn = min(n, b[i]);
        for(j = sumb; j >= b[i]; j--) {
            dp[j] = max(dp[j], dp[j - b[i]] + mn);
        }
    }

    for(i = suma; i <= sumb; i++) {
        if(dp[i] >= n * k) {
            cout << i - suma;
            return 0;
        }
    }

    cout << "Impossible";

    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 404 KB Output is correct
5 Correct 2 ms 376 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 376 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 404 KB Output is correct
5 Correct 2 ms 376 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 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 420 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 632 KB Output is correct
2 Correct 8 ms 504 KB Output is correct
3 Correct 9 ms 504 KB Output is correct
4 Correct 14 ms 632 KB Output is correct
5 Correct 14 ms 632 KB Output is correct
6 Correct 7 ms 504 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 388 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 404 KB Output is correct
5 Correct 2 ms 376 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 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 420 KB Output is correct
14 Correct 10 ms 632 KB Output is correct
15 Correct 8 ms 504 KB Output is correct
16 Correct 9 ms 504 KB Output is correct
17 Correct 14 ms 632 KB Output is correct
18 Correct 14 ms 632 KB Output is correct
19 Correct 7 ms 504 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 388 KB Output is correct
25 Correct 8 ms 632 KB Output is correct
26 Correct 10 ms 632 KB Output is correct
27 Correct 4 ms 376 KB Output is correct
28 Correct 8 ms 504 KB Output is correct
29 Correct 11 ms 632 KB Output is correct
30 Correct 15 ms 760 KB Output is correct