Submission #796637

#	Time	Username	Problem	Language	Result	Execution time	Memory
796637		vjudge1	Kitchen (BOI19_kitchen)	C++17	21 / 100	62 ms	136036 KiB

kitchen

#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define int long long
//#define ld long double
using namespace std;
using ll=long long;
const int inf = 2e18;
const int MN = 305;
const int mod=1e9+7;
int n,m,k;
int a[MN],b[MN];
int dp[MN][MN*MN];
int mx,sum;
inline void solve() {
	cin>>n>>m>>k;
	for (int i=1; i<=n; i++) {
		cin>>a[i];
		if(a[i]<k) {
			cout<<"Impossible";
			return;
		}
		mx+=a[i];
	}
	for (int i=1; i<=m; i++) {
		cin>>b[i];
		sum+=b[i];
	}
	for (int i=1; i<=m; i++) {
		for (int w=sum; w>=0; w--) {
			dp[i][w]=dp[i-1][w];
			if(w+b[i]<=sum) dp[i][w+b[i]]=max(dp[i][w+b[i]],dp[i-1][w]+min(b[i],n));
		}
	}
	for (int i=mx; i<=sum; i++) {
		if(dp[m][i]>=n*k) {
			cout<<i-mx;
			return;
		}
	}
	cout<<"Impossible";
//	cout<<mn;
}
signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
//	preprocess();
//	cin>>t;
	while(t--) {
		solve();
	}	
}

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