oj.uz

Submission #933728

# Submission time Handle Problem Language Result Execution time Memory
933728 2024-02-26T08:03:04 Z Whisper Kitchen (BOI19_kitchen) C++17
100 / 100
 22 ms 2700 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

int nMeal, nChef, numNeed;
int a[MAX], b[MAX];
int sum = 0;

int dp[MAX];
void Whisper(){
    cin >> nMeal >> nChef >> numNeed;
    for (int i = 1; i <= nMeal; ++i) cin >> a[i], sum += a[i];
    for (int i = 1; i <= nChef; ++i) cin >> b[i];

    if (*min_element(a + 1, a + nMeal + 1) < numNeed) return void(cout << "Impossible");
    memset(dp, -0x3f, sizeof dp);
    dp[0] = 0;
    for (int i = 1; i <= nChef; ++i){
        for (int v = MAX - 1; v >= b[i]; --v){
            maximize(dp[v], dp[v - b[i]] + min(nMeal, b[i]));
        }
    }
    for (int i = sum; i < MAX; ++i){
        if (dp[i] >= nMeal * numNeed){
            cout << i - sum; return;
        }
    }
    cout << "Impossible";
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2648 KB Output is correct
2 Correct 15 ms 2648 KB Output is correct
3 Correct 19 ms 2652 KB Output is correct
4 Correct 20 ms 2652 KB Output is correct
5 Correct 18 ms 2652 KB Output is correct
6 Correct 14 ms 2652 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2648 KB Output is correct
2 Correct 3 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 17 ms 2648 KB Output is correct
15 Correct 15 ms 2648 KB Output is correct
16 Correct 19 ms 2652 KB Output is correct
17 Correct 20 ms 2652 KB Output is correct
18 Correct 18 ms 2652 KB Output is correct
19 Correct 14 ms 2652 KB Output is correct
20 Correct 3 ms 2648 KB Output is correct
21 Correct 3 ms 2652 KB Output is correct
22 Correct 3 ms 2652 KB Output is correct
23 Correct 3 ms 2652 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 18 ms 2700 KB Output is correct
26 Correct 16 ms 2516 KB Output is correct
27 Correct 11 ms 2652 KB Output is correct
28 Correct 16 ms 2696 KB Output is correct
29 Correct 16 ms 2700 KB Output is correct
30 Correct 22 ms 2652 KB Output is correct