제출 #569164

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
569164		Uzouf	Kitchen (BOI19_kitchen)	C++14	0 / 100	24 ms	1028 KiB

kitchen

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e9+7;
const int N=2e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(".in", "r", stdin); freopen(".out", "w", stdout);

    int n,m,k; cin>>n>>m>>k;
    int a[n],b[m];
    int suma=0;
    bool bl=true;
    for (int &i:a) {
      cin>>i;
      if (i<k || m<k) bl=false;
      suma+=i;
    }
    for (int &i:b) cin>>i;

    if (!bl) {
      cout<<"Impossible"; return 0;
    }

    int dp[90000];
    for (int i=0;i<90000;i++) dp[i]=-1e18;

    for (int i=0;i<m;i++) {
      for (int j=b[i];j<90000;j++) {
        dp[j]=max(dp[j],dp[j-b[i]]+min(n,b[i]));
      }
    }

    for (int i=suma;i<90000;i++) {
      if (dp[i]>=k*n) {
        cout<<i-suma; return 0;
      }
    }

    cout<<"Impossible";

}

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