oj.uz

Submission #368493

# Submission time Handle Problem Language Result Execution time Memory
368493 2021-02-20T04:48:57 Z jainbot27 Kitchen (BOI19_kitchen) C++17
100 / 100
 35 ms 896 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 = 305;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int n, m, k;
int a[mxN], b[mxN];
int dp[mxN*mxN];

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];
    F0R(i, m) cin >> b[i];
    if(*min_element(a, a+n)<k) no();
    F0R(i, mxN*mxN) dp[i] = -MOD;
    dp[0] = 0;
    F0R(i, m){
        R0F(j, mxN*mxN-b[i]){
            ckmax(dp[j+b[i]], dp[j]+min(n, b[i]));
        }    
    }
    FOR(i, accumulate(a, a+n, 0), mxN*mxN){
        if(dp[i] >= n*k){
            cout << i-accumulate(a, a+n, 0) << nl;
            return 0;
        }
    }
    no();
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 896 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 896 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 2 ms 748 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 748 KB Output is correct
2 Correct 24 ms 748 KB Output is correct
3 Correct 26 ms 748 KB Output is correct
4 Correct 32 ms 748 KB Output is correct
5 Correct 23 ms 748 KB Output is correct
6 Correct 24 ms 748 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 748 KB Output is correct
2 Correct 4 ms 748 KB Output is correct
3 Correct 5 ms 892 KB Output is correct
4 Correct 4 ms 748 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 896 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 27 ms 748 KB Output is correct
15 Correct 24 ms 748 KB Output is correct
16 Correct 26 ms 748 KB Output is correct
17 Correct 32 ms 748 KB Output is correct
18 Correct 23 ms 748 KB Output is correct
19 Correct 24 ms 748 KB Output is correct
20 Correct 5 ms 748 KB Output is correct
21 Correct 4 ms 748 KB Output is correct
22 Correct 5 ms 892 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 25 ms 748 KB Output is correct
26 Correct 31 ms 748 KB Output is correct
27 Correct 14 ms 664 KB Output is correct
28 Correct 31 ms 768 KB Output is correct
29 Correct 26 ms 768 KB Output is correct
30 Correct 35 ms 748 KB Output is correct