oj.uz

Submission #758816

# Submission time Handle Problem Language Result Execution time Memory
758816 2023-06-15T10:47:34 Z Hanksburger Kitchen (BOI19_kitchen) C++17
21 / 100
 62 ms 92560 KB 
#include <bits/stdc++.h>
using namespace std;
int dp[305][90005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m, k, sum=0;
    cin >> n >> m >> k;
    for (int i=1; i<=n; i++)
    {
        int x;
        cin >> x;
        if (x<k)
        {
            cout << "Impossible";
            return 0;
        }
        sum+=x;
    }
    for (int i=1; i<=90000; i++)
        dp[0][i]=-1e9;
    for (int i=1; i<=m; i++)
    {
        int x;
        cin >> x;
        for (int j=0; j<=90000; j++)
            dp[i][j]=max(dp[i-1][j], j>=x?(dp[i-1][j-x]+min(x, n)):0);
    }
    for (int i=sum; i<=90000; i++)
    {
        if (dp[m][i]>=n*k)
        {
            cout << i-sum;
            return 0;
        }
    }
    cout << "Impossible";
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14676 KB Output is correct
2 Correct 10 ms 14676 KB Output is correct
3 Correct 10 ms 14660 KB Output is correct
4 Correct 10 ms 14664 KB Output is correct
5 Correct 1 ms 324 KB Output is correct

Subtask #5
0 / 28.0

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