# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337063 | boykut | Bank (IZhO14_bank) | C++14 | 75 ms | 492 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;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector < int > a(n);
vector < int > b(m);
vector < int > used(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
if (n <= 20 && m <= 20) {
int cnt = 0;
for (int I = 0; I < n; I++) {
int ok = 0, mn = -1, mnnum = -1;
for (int i = 0; i < (1 << m); i++) {
int sum = 0, num = i, index = m - 1, cnt1 = 0;
while (num) {
if ((num & 1) && !used[index]) {
sum += b[index], cnt1++;
}
index--;
num /= 2;
}
if (sum == a[I]) {
if (mn == -1 || cnt1 < mn) {
mn = cnt1;
mnnum = i;
}
}
}
if (mn != -1) {
cnt++;
int index = m - 1;
while (mnnum) {
if ((mnnum & 1) && !used[index]) {
used[index] = 1;
}
index--;
mnnum /= 2;
}
}
}
cnt == n ? cout << "YES\n" : cout << "NO\n";
}
return 0;
}
Compilation message (stderr)
# | 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... |