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>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define fi first
#define se second
#define new new228
#define pb push_back
#define rank rank228
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma warning(disable : 4996)
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key();
const int N = 25;
const int INF = 1e15;
const int MAXN = 4 * N;
const int MOD = 998244353;
int TN = 1;
int n, m;
bool us[N];
int a[N], b[N];
map<int, vector<int> > v;
map<pair<int, int>, bool> dp;
void printbin(int x) {
while (x) {
printf("%d", x % 2);
x /= 2;
}
}
void rec(int pos, int mask) {
/*
printf("rec(%d, ", pos);
printbin(mask);
printf(")\n");
*/
if (dp[{pos, mask}]) return;
if (pos == n + 1) {
printf("YES\n");
exit(0);
}
for (int i = 0; i < v[a[pos]].size(); i++) {
int cur = v[a[pos]][i];
if ((mask & cur) == cur) {
rec(pos + 1, mask ^ cur);
}
}
dp[{pos, mask}] = 1;
}
signed main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int mask = 1; mask < (1 << m); mask++) {
int sum = 0;
for (int j = 0; j < m; j++) {
if (mask & (1 << j))
sum += b[j];
}
v[sum].pb(mask);
}
/*
for (int i = 1; i <= n; i++) {
printf("%d : ", a[i]);
for (int j = 0; j < v[a[i]].size(); j++) {
int tmp = v[a[i]][j];
printbin(tmp);
printf(" ");
}
printf("\n");
}
*/
rec(1, (1 << m) - 1);
puts("NO");
return 0;
}
Compilation message (stderr)
bank.cpp:22:0: warning: ignoring #pragma warning [-Wunknown-pragmas]
#pragma warning(disable : 4996)
bank.cpp:27:17: warning: overflow in implicit constant conversion [-Woverflow]
const int INF = 1e15;
^~~~
bank.cpp: In function 'void rec(int, int)':
bank.cpp:57:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v[a[pos]].size(); i++) {
~~^~~~~~~~~~~~~~~~~~
bank.cpp: In function 'int main()':
bank.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &m);
~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &a[i]);
~~~~~^~~~~~~~~~~~~
bank.cpp:72:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &b[i]);
~~~~~^~~~~~~~~~~~~
# | 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... |