oj.uz

답안 #136430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136430 2019-07-25T09:49:53 Z popovicirobert Kitchen (BOI19_kitchen) C++14
20 / 100
 22 ms 376 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 MAXN = 300;

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

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

    cin >> n >> m >> k;

    int sum = 0, suma = 0;
    for(i = 1; i <= n; i++) {
        cin >> a[i];
        sum += a[i] - (k - 1);
        suma += a[i];
    }

    if(*min_element(a + 1, a + n + 1) < k) {
        cout << "Impossible";
        return 0;
    }

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

    sort(b + 1, b + m + 1);
    sum = min(sum, b[m]);

    dp[0] = i = 1;

    while(i <= m && b[i] <= sum) {
        for(int j = sumb; j >= b[i]; j--) {
            dp[j] |= dp[j - b[i]];
        }
        i++;
    }

    i = suma;
    while(i <= sumb && dp[i] == 0) {
        i++;
    }

    if(i > sumb) {
        cout << "Impossible";
        return 0;
    }

    cout << i - suma;

    return 0;
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:96:15: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
     dp[0] = i = 1;
             ~~^~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 376 KB Output is correct
2 Correct 12 ms 376 KB Output is correct
3 Correct 13 ms 376 KB Output is correct
4 Correct 21 ms 376 KB Output is correct
5 Correct 22 ms 376 KB Output is correct
6 Correct 10 ms 376 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -