oj.uz

답안 #1014613

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014613 2024-07-05T08:04:28 Z Error404 Kitchen (BOI19_kitchen) C++17
100 / 100
 163 ms 225108 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];
    bool found[m+1][sum+1];
    memset(dp,0,sizeof(dp));
     memset(found,0,sizeof(found));
    dp[0][0]=0;
    found[0][0]=1;
    for(int i =1; i <= m; i++){
        for(int j = 0; j<=sum; j++){
            dp[i][j] = dp[i-1][j];
            found[i][j] = found[i-1][j];
            if(j>=chef[i]&& found[i-1][j-chef[i]] ){
                dp[i][j] = max(dp[i][j], dp[i-1][j-chef[i]]+ min(chef[i], n));      
                found[i][j]=1;

            }
        }
    }





    for(int i = target; i <= sum; i++){
   //    cout <<dp[m][i]<<" "<< i << endl;
        if(dp[m][i]>=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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 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 2652 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
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 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 2652 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 3164 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 154708 KB Output is correct
2 Correct 90 ms 116284 KB Output is correct
3 Correct 87 ms 129872 KB Output is correct
4 Correct 147 ms 221268 KB Output is correct
5 Correct 152 ms 221776 KB Output is correct
6 Correct 61 ms 94840 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 2652 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 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 2652 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 3164 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 105 ms 154708 KB Output is correct
15 Correct 90 ms 116284 KB Output is correct
16 Correct 87 ms 129872 KB Output is correct
17 Correct 147 ms 221268 KB Output is correct
18 Correct 152 ms 221776 KB Output is correct
19 Correct 61 ms 94840 KB Output is correct
20 Correct 1 ms 3160 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 1 ms 3164 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 78 ms 113796 KB Output is correct
26 Correct 94 ms 140476 KB Output is correct
27 Correct 28 ms 43352 KB Output is correct
28 Correct 84 ms 115352 KB Output is correct
29 Correct 106 ms 157524 KB Output is correct
30 Correct 163 ms 225108 KB Output is correct