| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 169378 | ruler | Kitchen (BOI19_kitchen) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
////////////////////////////////////////////////////////////////////
const int N = 1e3 + 5;
int B[N], DP[2][N * N];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m, k, sum = 0; cin >> n >> m >> k;
if (m < k) die("Impossible");
for (int i = 0; i < n; i++) {
int a; cin >> a;
sum += a;
if (a < k) die("Impossible");
}
for (int i = 1; i <= m; i++) for (int j = 0; j < N * N; j++) DP[i & 1][j] = - INF * INF;
DP[0][0] = 0;
for (int i = 1; i <= m; i++) cin >> B[i];
for (int i = 1; i <= m; i++) for (int j = 0; j < N * N; j++) {
DP[i & 1][j] = DP[i - 1][j];
if (j >= B[i]) DP[i & 1][j] = max(DP[i & 1][j], DP[(i - 1) & 1][j - B[i]] + min(B[i], n));
}
for (int i = 0; i + sum < N * N; i++) if (DP[m & 1][i + sum] >= n * k) die(i);
return 0;
}