Submission #493428

#	Time	Username	Problem	Language	Result	Execution time	Memory
493428		wiwiho	Kitchen (BOI19_kitchen)	C++14	100 / 100	26 ms	972 KiB

kitchen

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 998244353;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

void nosol(){
    cout << "Impossible\n";
    exit(0);
}

const int SZ = 300;

int main(){
    StarBurstStream

    int n, m, k;
    cin >> n >> m >> k;
    
    vector<int> a(n + 1), b(m + 1);
    int sa = 0, sb = 0;
    for(int i = 1; i <= n; i++) cin >> a[i], sa += a[i];
    for(int i = 1; i <= m; i++) cin >> b[i], sb += b[i];

    if(k > m || sb < sa) nosol();
    for(int i = 1; i <= n; i++) if(a[i] < k) nosol();

    vector<ll> dp(SZ * m + 5, -MAX);
    dp[0] = 0;
    
    for(int i = 1; i <= m; i++){
        for(int j = SZ * m; j >= b[i]; j--){
            dp[j] = max(dp[j], dp[j - b[i]] + min(n, b[i]));
        }
    }
    
    for(int i = sa; i <= SZ * m; i++){
        if(dp[i] < n * k) continue;
        cout << i - sa << "\n";
        return 0;
    }
    nosol();
    
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 22 / 22
• Subtask 3: 20 / 20
• Subtask 4: 21 / 21
• Subtask 5: 28 / 28