oj.uz

Submission #1087334

# Submission time Handle Problem Language Result Execution time Memory
1087334 2024-09-12T13:43:15 Z steveonalex Kitchen (BOI19_kitchen) C++17
100 / 100
 95 ms 1116 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }



int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

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

    vector<int> b(m);
    for(int i = 0; i<m; ++i) cin >> b[i];

    if (*min_element(ALL(a)) < k){
        cout << "Impossible\n";
        return 0;
    }
    int barrier = n * k;
    int sumA = 0, sumB = 0;
    for(int i: a) sumA += i;
    for(int i: b) sumB += i;

    int dp[2][sumB + 1];
    memset(dp, -1, sizeof dp);
    dp[0][0] = 0;
    int ans = 1e9;
    for(int i: b){
        for(int j = 0; j <= sumB; ++j) if (dp[0][j] != -1 && j + i <= sumB){
            maximize(dp[1][j + i], dp[0][j] + min(i, n));
            maximize(dp[1][j], dp[0][j]);
        }
        for(int j = 0; j <= sumB; ++j){
            dp[0][j] = dp[1][j];
            dp[1][j] = -1;
            if (dp[0][j] >= barrier && j >= sumA)
                minimize(ans, j - sumA);
        }
    }

    if (ans == 1e9) cout << "Impossible\n";
    else cout << ans << "\n";
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1116 KB Output is correct
2 Correct 28 ms 860 KB Output is correct
3 Correct 36 ms 604 KB Output is correct
4 Correct 59 ms 860 KB Output is correct
5 Correct 59 ms 1116 KB Output is correct
6 Correct 24 ms 604 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 43 ms 1116 KB Output is correct
15 Correct 28 ms 860 KB Output is correct
16 Correct 36 ms 604 KB Output is correct
17 Correct 59 ms 860 KB Output is correct
18 Correct 59 ms 1116 KB Output is correct
19 Correct 24 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 27 ms 860 KB Output is correct
26 Correct 35 ms 860 KB Output is correct
27 Correct 11 ms 604 KB Output is correct
28 Correct 33 ms 864 KB Output is correct
29 Correct 40 ms 860 KB Output is correct
30 Correct 95 ms 1116 KB Output is correct