# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
606793 | jjiangly | Bank (IZhO14_bank) | C++14 | 1081 ms | 320 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;
#define all(x) x.begin(), x.end()
#define siz(x) int(x.size())
#define ll long long
#define ar array
#define vt vector
#define inf INT_MAX
#define lnf LLONG_MAX
const int nxm = int(2e5) + 7;
int n, m, a[25], b[25];
namespace sub1 {
void exe() {
bool ok = false;
function<void(int, int)> work = [&](int idx, int v) {
if (idx == m) {
ok = (v == a[0] ? true : ok);
return;
}
work(idx + 1, v + b[idx]);
work(idx + 1, v);
};
work(0, 0);
cout << (ok ? "YES" : "NO") << "\n";
}
};
# | 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... |