oj.uz

Submission #1014601

# Submission time Handle Problem Language Result Execution time Memory
1014601 2024-07-05T07:49:13 Z Error404 Kitchen (BOI19_kitchen) C++17
30 / 100
 89 ms 137928 KB 
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define f first
#define s second
#define pi pair<ll,ll>
#define vi vector<ll>
#define vd vector<double>
#define vpi vector<pi>
#define pb push_back
#define INF 1e18
#define endl '\n'
//#define int ll
#define pii pair<pi,ll>



const int mod = 1e9+7;
const int MAX = 1e5+1;
const int LOG = 30;
vi g[MAX];
int tin[MAX], val[MAX], tout[MAX];
int up[LOG+1][MAX];
map<pi,int>mp;
vector<pi>order;
int timer = 0;


signed main(){
    int n,m,k,a,b;
    cin >>n >> m >> k;
    int dish[n+1], chef[m+1];

    ll sum = 0, target = 0;;

    for(int i= 1; i<= n; i++){
        cin >> dish[i];
        target += dish[i];
        if(dish[i]<k) {
            cout << "Impossible" << endl;
            return 0;
        }
    }
  
    for(int i = 1; i <=m; i++){
        cin >> chef[i];
        sum +=chef[i];
    }

    ll dp[m+1][sum+1];
    memset(dp,0,sizeof(dp));
    dp[0][0]=1;
    for(int i =1; i <= m; i++){
        for(int j = 0; j<=sum; j++){
            dp[i][j] = dp[i-1][j];
            if(j>=chef[i] && dp[i][j-chef[i]]) dp[i][j] = max(dp[i][j], dp[i-1][j-chef[i]]+ min(chef[i], n));
        }
    }





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

    cout << "Impossible" << endl;

}     
/*

6 1 1
1 3
2 3
3 4
6 4
4 5
4 1 3 2 5


*/

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:30:15: warning: unused variable 'a' [-Wunused-variable]
   30 |     int n,m,k,a,b;
      |               ^
kitchen.cpp:30:17: warning: unused variable 'b' [-Wunused-variable]
   30 |     int n,m,k,a,b;
      |                 ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2732 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2732 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Incorrect 2 ms 3164 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 89 ms 137928 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 2 ms 3160 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2732 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Incorrect 2 ms 3164 KB Output isn't correct
14 Halted 0 ms 0 KB -