oj.uz

Submission #1095285

# Submission time Handle Problem Language Result Execution time Memory
1095285 2024-10-01T18:12:10 Z Tymond Kitchen (BOI19_kitchen) C++17
100 / 100
 25 ms 828 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
 
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int INF = 1e9;
const int MAXN = 3e2 + 7;
const int MAXS = 9e4 + 7;
int a[MAXN];//zadania
int b[MAXN];//kucharze
int dp[MAXS];
int n, m, k;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }

    for(int i = 1; i <= m; i++){
        cin >> b[i];
    }

    for(int i = 1; i < MAXS; i++){
        dp[i] = -INF;
    }
    dp[0] = 0;
    for(int i = 1; i <= m; i++){
        for(int j = MAXS - b[i] - 1; j >= 0; j--){
            if(dp[j] == -INF){
                continue;
            }
            dp[j + b[i]] = max(dp[j + b[i]], dp[j] + min(n, b[i]));
        }
    }

    int sum = 0;
    for(int i = 1; i <= n; i++){
        sum += a[i];
        if(a[i] < k){
            cout << "Impossible\n";
            return 0;
        }
    }

    int ans = INF;
    for(int i = sum; i < MAXS; i++){
        if(dp[i] >= n * k){
            ans = i - sum;
            break;
        }
    }

    if(ans == INF){
        cout << "Impossible\n";
    }else{
        cout << ans << '\n';
    }

    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 604 KB Output is correct
2 Correct 14 ms 604 KB Output is correct
3 Correct 20 ms 828 KB Output is correct
4 Correct 21 ms 604 KB Output is correct
5 Correct 25 ms 604 KB Output is correct
6 Correct 14 ms 600 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 732 KB Output is correct
5 Correct 3 ms 604 KB Output is correct

Subtask #5
28.0 / 28.0

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