제출 #752048

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
752048		GrindMachine	Kitchen (BOI19_kitchen)	C++17	0 / 100	1 ms	212 KiB

kitchen

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,m,k; cin >> n >> m >> k;
    vector<ll> a(n), b(m);
    rep(i,n) cin >> a[i];
    rep(i,m) cin >> b[i];

    if(k > m){
        cout << "Impossible" << endl;
        return;
    }

    rep(i,n){
        if(a[i] < k){
            cout << "Impossible" << endl;
            return;
        }
    }

    ll suma = 0;
    rep(i,n) suma += a[i];

    ll ans = inf2;

    rep(mask, 1 << m){
        if(setbits(mask) < k) conts;

        priority_queue<ll> pq;
        ll sum = 0;
        ll contrib = 0;

        rep(i,m){
            if(mask & (1 << i)){
                pq.push(b[i]);
                sum += b[i];
                contrib += min(b[i],n);
            }
        }

        if(contrib < n*k) conts;

        bool flag = true;

        // rep(i,n){
        //     vector<ll> guys;
        //     rep(j,k){
        //         guys.pb(pq.top());
        //         pq.pop();
        //     }

        //     ll x = a[i];
        //     ll at_least = k;

        //     trav(y,guys){
        //         at_least--;
        //         ll mx_red = x - at_least;
        //         ll reduce = min(y, mx_red);
        //         x -= reduce;
        //         pq.push(y-reduce);
        //     }

        //     if(x > 0){
        //         flag = false;
        //     }
        // }

        if(flag){
            amin(ans, sum - suma);
        }
    }

    if(ans == inf2){
        cout << "Impossible" << endl;
    }
    else{
        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

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