oj.uz

Submission #134946

# Submission time Handle Problem Language Result Execution time Memory
134946 2019-07-23T13:11:18 Z Bodo171 Kitchen (BOI19_kitchen) C++14
21 / 100
 13 ms 1144 KB 
#include <iostream>
#include <fstream>
#include <bitset>
#include <algorithm>
using namespace std;
const int nmax=305;
bitset<nmax*nmax> pot,dp[nmax];
int minim[nmax*nmax];
int a[nmax];
int n,m,k,sum,i,j,x;
int main()
{
    //freopen("data.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin>>n>>m>>k;
    for(i=1;i<=n;i++)
    {
        cin>>x;sum+=x;
        if(x<k)
        {
            cout<<"Impossible\n";
            return 0;
        }
    }
    for(i=1;i<=m;i++)
        cin>>a[i];
    sort(a+1,a+m+1);
    pot[0]=1;
    for(i=1;i<=m&&a[i]<=n;i++)
    {
        pot=(pot|(pot<<a[i]));
    }
    dp[0][0]=1;
    for(i=m;i>=1&&a[i]>n;i--)
    {
        for(j=k-1;j>=0;j--)
            dp[j+1]=(dp[j+1]|(dp[j]<<a[i]));
    }
    minim[90001]=(1<<30);
    for(i=90000;i>=0;i--)
    {
         if(pot[i]==1) minim[i]=i;
         else minim[i]=minim[i+1];
    }
    int ans=(1<<30);
    for(i=0;i<=k;i++)
        for(j=0;j<=90000;j++)
            if(dp[i][j]==1)
              ans=min(ans,j+minim[max((k-i)*n,sum-j)]);
    if(ans==(1<<30)) cout<<"Impossible\n";
    else cout<<ans-sum;
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1144 KB Output is correct
2 Correct 10 ms 1020 KB Output is correct
3 Correct 6 ms 760 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
0 / 28.0

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