oj.uz

Submission #332836

# Submission time Handle Problem Language Result Execution time Memory
332836 2020-12-03T16:29:21 Z sinamhdv Kitchen (BOI19_kitchen) C++11
0 / 100
 61 ms 68460 KB 
// https://oj.uz/problem/view/BOI19_kitchen
// n3 solution
#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 + ((ll)(a) - (b)) % mod) % mod)
#define mdiv(a, b) ((ll)(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

int asum, bsum;
int dp[MAXN][MAXN * MAXN];
int a[MAXN], b[MAXN];
int n, m, k;

int32_t main(void)
{
	fast_io;
	cin >> n >> m >> k;
	FOR(i, 1, n + 1)
	{
		cin >> a[i];
		if (a[i] < k)
		{
			cout << "Impossible\n";
			return 0;
		}
		asum += a[i];
	}
	FOR(i, 1, m + 1)
	{
		cin >> b[i];
		bsum += b[i];
	}
	FOR(i, 1, m + 1)
	{
		FOR(j, 0, bsum + 1)
		{
			dp[i][j] = dp[i - 1][j];
			if (j >= b[i])
			{
				dp[i][j] = max(dp[i][j], dp[i - 1][j - b[i]] + min(b[i], n));
			}
		}
	}
	FOR(i, 0, bsum + 1)
	{
		if (dp[m][i] >= n * k)
		{
			cout << i - asum << endl;
			return 0;
		}
	}
	cout << "Impossible\n";
	return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 61 ms 68460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Incorrect 1 ms 748 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -