Submission #928871

#	Time	Username	Problem	Language	Result	Execution time	Memory
928871		Muhammad_Aneeq	Kitchen (BOI19_kitchen)	C++17	0 / 100	17 ms	856 KiB

kitchen

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
using namespace std;
int const N=300*300+10;
int dp[N]={};
inline void solve()
{
    int n,m,k;
    cin>>n>>m>>k;
    int z=0;
    int a[n];
    for (auto& i:a)
    {
        cin>>i,z+=i;
        if (i<0)
        {
            cout<<"Impossible\n";return;
        }
    }
    dp[0]=0;
    for (int i=0;i<m;i++)
    {
        int x;
        cin>>x;
        for (int j=N-x-1;j>=0;j--)
            dp[j+x]=max(dp[j+x],dp[j]+min(x,n));
    }
    for (int i=z;i<N;i++)
    {
        if (dp[i]>=k*n)
        {
            cout<<i-z<<'\n';
            return;
        }
    }
    cout<<"Impossible\n";
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28