# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636004 | TUNGDUONGWILLWINVOI2023 | Bank (IZhO14_bank) | C++14 | 1091 ms | 10444 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 <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
int n, m, a[22], b[22];
vector<int> f[20005];
bool dp[1 << 20], ndp[1 << 20];
int main() {
// Coding
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; ++i) {
scanf("%d", &b[i]);
}
for (int mask = 0; mask < (1 << m); ++mask) {
int sum = 0;
for (int i = 0; i < m; ++i) {
if (mask >> i & 1) {
sum += b[i];
}
}
f[sum].push_back(mask);
}
dp[0] = true;
int tot = 0;
for (int i = 0; i < n; ++i) {
tot += a[i];
memset(ndp, false, sizeof(ndp));
for (int mask : f[tot - a[i]]) {
ndp[mask] = dp[mask];
}
memset(dp, false, sizeof(dp));
for (int mask = 0; mask < (1 << m); ++mask) {
for (int j = 0; j < m; ++j) {
if (mask >> j & 1 || !ndp[mask]) {
continue;
}
ndp[mask ^ (1 << j)] = (ndp[mask] ? true : ndp[mask ^ (1 << j)]);
}
}
for (int mask : f[tot]) {
dp[mask] = (ndp[mask] ? true : dp[mask]);
}
}
for (int mask : f[tot]) {
if (dp[mask]) {
puts("YES");
return 0;
}
}
puts("NO");
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... |