# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331896 | vitkishloh228 | 은행 (IZhO14_bank) | C++14 | 1085 ms | 90732 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>
using namespace std;
const int maxc = 20000 + 1;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for (int& i : a) cin >> i;
for (int& i : b) cin >> i;
vector<int> pr(n + 1);
for (int i = 0; i < n; ++i) {
pr[i + 1] = pr[i] + a[i];
}
vector<int> summask((1 << m));
for (int mask = 0; mask < (1 << m); ++mask) {
for (int i = 0; i < m; ++i) {
if ((mask & (1 << i))) {
summask[mask] += b[i];
}
}
}
vector<int> needmask = { 0 };
vector<vector<int>> dp(n, vector<int>(1 << m));
for (int i = 0; i < n; ++i) {
int needsum = pr[i];
vector<int> q;
for (int mask = 0; mask < (1 << m); ++mask) {
if (summask[mask] != pr[i + 1]) {
continue;
}
for (auto mask1 : needmask) {
if ((mask & mask1) == mask1) {
dp[i][mask] = 1;
q.push_back(mask);
break;
}
}
}
needmask = q;
}
for (int i = 0; i < (1 << m); ++i) {
if (dp[n - 1][i]) {
cout << "YES";
return 0;
}
}
cout << "NO";
}
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... |