oj.uz

Submission #368430

# Submission time Handle Problem Language Result Execution time Memory
368430 2021-02-20T04:20:42 Z jainbot27 Kitchen (BOI19_kitchen) C++17
0 / 100
 1 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 301;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int n, m, k;
int a[mxN], b[mxN], suma, sumb;
priority_queue<int> pq;

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

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> k;
    F0R(i, n) cin >> a[i], suma += a[i];
    F0R(i, m) cin >> b[i], sumb += b[i];
    if(sumb < suma) no();
    F0R(i, m){
        pq.push(b[i]);
    }
    F0R(i, n){
        if(a[i] < k) no();
        if(siz(pq)<k){
            no();
        }
        vi x;
        F0R(j, k){
            x.pb(pq.top()); pq.pop();
            x[j]--;
        }
        F0R(j, k){
            if(x[j]!=0) pq.push(x[j]);
        }
    }
    cout << sumb - suma  << nl;

    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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