oj.uz

Submission #1005265

# Submission time Handle Problem Language Result Execution time Memory
1005265 2024-06-22T09:27:14 Z vjudge1 Kitchen (BOI19_kitchen) C++17
0 / 100
 15 ms 856 KB 
#pragma GCC optimize("-O3")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define p_b pop_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const ll sz = 9e4+5;
ll dp[sz];
void solve()
{
    ll n, m, k, sum = 0, sumb = 0, i, j;
    cin >> n >> m >> k;
    ll a[n+5], b[m+5];
    for(i = 1; i <= n; i++){
        cin >> a[i];
        sum += a[i];
    }
    for(i = 1; i <= m; i++){
        cin >> b[i];
        sumb += b[i];
    }
    sort(a+1, a+n+1);
    sort(b+1, b+m+1);
    if(m < k || a[1] < k)
    {
        cout << "Impossible\n";
        return;
    }
    for(i = 1; i <= m; i++)
    {
        for(j = sz; j >= b[i]; j--)
        {
            if(j == b[i] || dp[j - b[i]])
                dp[j] = max(dp[j], dp[j-b[i]] + min(b[i], n));
        }
    }
    for(i = 1; i <= sz; i++)
    {
        if(dp[i] >= n * k)
        {
            cout << i - sum << "\n";
            return;
        }
    }
    cout << "Impossible\n";
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll tests = 1;
    //cin >> tests;
    while(tests--)
    {
        solve();
    }
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 3 ms 464 KB Output is correct
3 Incorrect 3 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

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