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;
const int N = 20;
int n, m, a[N + 5], b[N + 5], ps[N + 5], dp[(1 << N) + 10], sm[(1 << N) + 10];
int main() {
ios:: sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
ps[0] = a[0];
for (int i = 1; i < n; i++)
ps[i] = a[i] + ps[i - 1];
for (int i = 0; i < m; i++)
for (int msk = 0; msk < 1 << m; msk++)
if (msk >> i & 1) {
bool flag = (sm[msk ^ (1 << i)] - ps[dp[msk ^ (1 << i)]] + b[i] == b[dp[msk ^ (1 << i)] + 1] && dp[msk ^ (1 << i)] + 1 < n);
dp[msk] = max(dp[msk], dp[msk ^ (1 << i)] + flag);
}
cout << (dp[(1 << m) - 1] ^ n - 1? "NO\n": "YES\n");
}
Compilation message (stderr)
bank.cpp: In function 'int main()':
bank.cpp:24:35: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
24 | cout << (dp[(1 << m) - 1] ^ n - 1? "NO\n": "YES\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... |