제출 #332837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
332837		sinamhdv	Kitchen (BOI19_kitchen)	C++11	100 / 100	126 ms	3948 KiB

kitchen

// https://oj.uz/problem/view/BOI19_kitchen
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
const ll LINF = (ll)INF * INF;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define msub(a, b) ((mod + ((a) - (b)) % mod) % mod)
#define mdiv(a, b) ((a) * poww((b), mod - 2) % mod)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 320

bitset<MAXN * MAXN> sdp[MAXN];
bool fdp[MAXN * MAXN];
int fsum[MAXN * MAXN];
int a[MAXN], b[MAXN];
int n, m, k;
int asum, bsum;

int32_t main(void)
{
	fast_io;
	cin >> n >> m >> k;
	FOR(i, 0, n)
	{
		cin >> a[i];
		if (a[i] < k)
		{
			cout << "Impossible\n";
			return 0;
		}
		asum += a[i];
	}
	FOR(i, 0, m)
	{
		cin >> b[i];
		bsum += b[i];
	}
	sort(b, b + m);
	int p;
	for (p = 0; p < m; p++)
	{
		if (b[p] > n)
		{
			break;
		}
	}
	
	// fdp
	fdp[0] = 1;
	FOR(i, 0, p)
	{
		for (int j = bsum; j >= b[i]; j--)
		{
			fdp[j] |= fdp[j - b[i]];
		}
	}

	// fsum
	int last = INF;
	for (int i = MAXN * MAXN - 1; i >= 0; i--)
	{
		if (fdp[i])
		{
			last = i;
		}
		fsum[i] = last;
	}

	// sdp
	sdp[0][0] = 1;
	FOR(i, p, m)
	{
		for (int x = i - p + 1; x > 0; x--)
		{
			sdp[x] |= (sdp[x - 1] << b[i]);
		}
	}

	// find ans
	int ans = INF;
	FOR(x, 0, m - p + 1)
	{
		FOR(j, 0, bsum + 1)
		{
			if (!sdp[x][j])
				continue;
			if (max(n * (k - x), asum - j) < 0)
			{
				ans = min(ans, j);
			}
			else
			{
				ans = min(ans, j + fsum[max(n * (k - x), asum - j)]);
			}
		}
	}
	if (ans >= INF)
	{
		cout << "Impossible\n";
		return 0;
	}
	cout << ans - asum << endl;
	return 0;
}

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