제출 #925866

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
925866		vjudge1	Kitchen (BOI19_kitchen)	C++17	51 / 100	193 ms	488 KiB

kitchen

#include<iostream>
#include<cassert>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<stack>
#include<set>
#include<queue>
#include<map>
#include<iomanip>
#include<bitset>

using namespace std;

const int N = (int)4e5 + 7;
const int inf = (int)1e9 + 7;
const int MOD = (int)998244353;
const long long INF = (long long)1e18 + 7; 

int mult(int x, int y) {
	return 1ll*x*y%MOD;
}

int sum(int x, int y) {
	x += y;
	if(x >= MOD) {
		x -= MOD;
	}
	return x;
}

int sub(int x, int y) {
	x -= y;
	if(x < 0) {
		x += MOD;
	}
	return x;
}

int n, m, k, old[301];
int a[301], b[301];

int main() {	
	ios_base::sync_with_stdio(NULL);
	cin.tie(0);
	cin >> n >> m >> k;
	int tot = 0;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		old[i] = a[i];
		tot += a[i];
	}
	for(int i = 1; i <= m; ++i) {
		cin >> b[i];
	}
	bitset<90005> dp;
	dp[0] = 1;
	for(int i = 1; i <= m; ++i) {
		dp |= (dp << b[i]);	
	}
	if(m<k) {
		cout << "Impossible\n";
		return 0;
	}
	if(k == 1) {
		for(int s = tot; s <= 90000; ++s) {
			if(dp[s]) {
				cout << s-tot << "\n";
				return 0;
			}
		}
		cout << "Impossible";
		return 0;
	}
	sort(b+1, b+1+m);
	int ans = inf;
	for(int mask = 1; mask < (1 << m); ++mask) {
		vector<int> c;
		for(int i = 0; i < m; ++i) {
			if(mask >> i & 1) {
				c.push_back(b[i+1]);
			}
		}	
		if((int)c.size() < k) {
			continue;
		}
		bool ok = 1;
		for(int i = 1; i <= n && ok; ++i) {
			sort(c.rbegin(), c.rend());
			if(a[i] < k) {
				ok = 0;
			}
			for(int j = 0; j < k && ok; ++j) {
				if(c[j] == 0) {
					ok = 0;
				} else {
					c[j]--;
				}
			}
			a[i] -= k;
		}
		if(ok) {
			int oto = 0;
			for(auto x : c) {
				oto += x;
			}
			for(int i = 1; i <= n; ++i) {
				oto -= a[i];
			}
			if(oto < 0) {
				for(int i = 1; i <= n; ++i) {
					a[i] = old[i];
				}
				continue;
			}
			int cur = 0;
			for(int i = 0; i < m; ++i) {
				if(mask >> i & 1) {
					cur += b[i+1];
				}
			}
			ans = min(ans, cur-tot);
		}
		for(int i = 1; i <= n; ++i) {
			a[i] = old[i];
		}
	}
	if(ans == inf) {
		cout << "Impossible\n";
		return 0;
	}
	cout << ans << "\n";
	return 0;
}

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