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>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, m;
std::cin >> n >> m;
std::vector<int> a(n), b(m), pre(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
pre[i] = a[i];
if (i > 0)
pre[i] += pre[i - 1];
}
for (int i = 0; i < m; i++) {
std::cin >> b[i];
}
std::vector<int> dp(1 << m);
dp[0] = 1;
for (int mask = 0; mask < (1 << m); mask++) {
if (dp[mask] == 0)
continue;
int sum = 0;
for (int i = 0; i < m; i++) {
if (mask & (1 << i))
sum += b[i];
}
int idx = 0;
while (idx < n && pre[idx] <= sum)
++idx;
if (idx == n) {
std::cout << "YES\n";
return 0;
}
for (int i = 0; i < m; i++) {
if (!(mask & (1 << i)) && sum + b[i] <= pre[idx])
dp[mask ^ (1 << i)] = 1;
}
}
std::cout << "NO";
}
# | 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... |