Submission #584205

#	Time	Username	Problem	Language	Result	Execution time	Memory
584205		amunduzbaev	Kitchen (BOI19_kitchen)	C++17	0 / 100	1 ms	340 KiB

kitchen

#include "bits/stdc++.h"
using namespace std;
 
#define ar array
typedef int64_t ll;
//~ #define int ll

const int N = 305;
int a[N], b[N];
bitset<N * N> dp;

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m, k; cin>>n>>m>>k;
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(a[i] < k){
			cout<<"impossible\n";
			return 0;
		}
	}
	for(int i=0;i<m;i++){
		cin>>b[i];
	}
	
	int sum = accumulate(a, a + n, 0);
	sort(b, b + m);
	int l = m, tot = 0;
	dp[0] = 1;
	for(int i=0;i<m;i++){
		if(b[i] > n) { l = i; break; }
		tot += b[i];
		dp |= (dp << b[i]);
	}
	
	int rem = 0, res = 1e9;
	while(l <= m && rem <= sum){
		for(int j=max(sum - rem, k * n);j<=tot;j++){
			if(dp[j]){
				res = min(res, rem + j - sum);
			}
		}
		
		rem += b[l++], k--;
	}
	res = min(res, rem - sum);
	if(res == 1e9) cout<<"impossible\n";
	else cout<<res<<"\n";
}

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