# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707020 | VladPislaru | Bank (IZhO14_bank) | C++17 | 1073 ms | 19804 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 <bits/stdc++.h>
using namespace std;
int n, m;
int a[1005], b[1005];
int sum[(1 << 20) + 5], nr_bit[(1 << 20) + 5];
unordered_set <int> poss[1005], sol;
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int j = 0; j < (1 << m); j++) {
for (int k = 0; k < m; k++)
if (j & (1 << k)) {
sum[j] += b[k];
nr_bit[j]++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < (1 << m); j++) {
if (sum[j] == a[i])
poss[i].insert(j);
# | 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... |