# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547303 | Stickfish | Kitchen (BOI19_kitchen) | C++17 | 172 ms | 4168 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.
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
using namespace std;
const int MAXN = 302;
const int SM = MAXN * 300;
int a[MAXN];
int b[MAXN];
bitset<SM> dps;
bitset<SM> dpb[MAXN];
signed main() {
int n, m, k;
cin >> n >> m >> k;
int needsm = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
needsm += a[i];
if (a[i] < k) {
cout << "Impossible\n";
return 0;
}
}
for (int i = 0; i < m; ++i)
cin >> b[i];
sort(b, b + m);
int bord = lower_bound(b, b + m, n) - b;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |