oj.uz

Submission #127529

# Submission time Handle Problem Language Result Execution time Memory
127529 2019-07-09T13:48:22 Z OptxPrime Kitchen (BOI19_kitchen) C++11
41 / 100
 139 ms 111164 KB 
#include <iostream>
#include <cmath>
#include<vector>
#include <algorithm>
#include <utility>
#include<stack>
#include<queue>
#include<map>
#include <fstream>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define maxn 310

int inf=1000000000;
int a[310],b[310];
int dp[310][maxn*maxn];


    int main()
    {
     //   ios_base::sync_with_stdio(false);
       // cin.tie(NULL);

        int n,m,k;
        int mealsum=0,sum=0;
        bool is=true;
        cin>>n>>m>>k;
        for( int i=1;i<=n;i++ ) {
            cin>>a[i];
            if( a[i] < k ){
              is=false;
              //  return 0;
            }
            mealsum+=a[i];
        }
        for( int i=1;i<=m;i++ ){
            cin>>b[i];
            sum+=b[i];
        }
        if(!is){
            cout << "Impossible" <<endl;
            return 0;
        }
        sum = 305*305;
      for( int i=0;i<=m;i++ ){
        for( int j=0;j<=sum;j++ ) dp[i][j]=-inf;
      }
      dp[0][0]=0;
      for( int i=1;i<=m;i++ ){
        for( int j=1;j<=sum;j++ ){
                if( j - b[i] >=0 )
            dp[i][j] = max( dp[i-1][j], dp[i-1][ j - b[i] ] + min( n,b[i] ) );
        else dp[i][j]=dp[i-1][j];
        }
      }

      for( int i = mealsum;i<= sum;i++ ){
        if( dp[m][i] >= n*k ){
            cout << i - mealsum << endl;
            return 0;
        }
      }
      cout << "Impossible" <<endl;
      return 0;
    }

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 96800 KB Output is correct
2 Correct 98 ms 83924 KB Output is correct
3 Correct 139 ms 111164 KB Output is correct
4 Correct 131 ms 111068 KB Output is correct
5 Correct 127 ms 107512 KB Output is correct
6 Correct 92 ms 77304 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 15480 KB Output is correct
2 Correct 20 ms 15480 KB Output is correct
3 Correct 20 ms 15480 KB Output is correct
4 Correct 20 ms 15480 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 1400 KB Output is correct
2 Incorrect 3 ms 1400 KB Output isn't correct
3 Halted 0 ms 0 KB -