Submission #957724

#	Time	Username	Problem	Language	Result	Execution time	Memory
957724		batsukh2006	Kitchen (BOI19_kitchen)	C++17	100 / 100	27 ms	1368 KiB

kitchen

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
using namespace std;
 
#define MOD 1000000007
#define int long long
#define ss second
#define ff first
#define endl '\n'
typedef pair<int,int> pp;
const int mxN=9e4+1;
vector<int> dp(mxN);
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n,m,k; cin>>n>>m>>k;
	vector<int> a(n+1),b(m+1);
	for(int i=1; i<=n; i++) cin>>a[i];
	for(int i=1; i<=m; i++) cin>>b[i];
	int sum=0;
	for(int i=1; i<=n; i++){
		sum+=a[i];
		if(a[i]<k){
			cout<<"Impossible";
			return 0;
		}
	}
	for(int i=1; i<=m; i++){
		for(int k=mxN; k>=b[i]; k--){
			if(dp[k-b[i]]>0||k-b[i]==0){
				dp[k]=max(dp[k],dp[k-b[i]]+min(b[i],n));
			}
		}
	}
	for(int i=sum; i<mxN; i++){
		if(dp[i]>=n*k){
			cout<<i-sum;
			return 0;
		}
	}
	cout<<"Impossible";
    return 0;
}

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