# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91090 | Aydarov03 | Bank (IZhO14_bank) | C++14 | 3 ms | 1060 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 <bits/stdc++.h>
using namespace std;
int a[25] , b[25];
vector <int> v[20005];
int n , m;
void rec( int id = 1 , int OR = 0)
{
if( id == n + 1)
{
cout << "YES";
exit(0);
}
for(auto c : v[ a[id] ] )
{
if( c & OR == 0 )
{
// cout << id << " " << c << endl;
rec( id+1 , OR | c );
}
}
}
main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= m; i++)
cin >> b[i];
for(int mask = 1; mask < (1<<m); mask++)
{
int sum = 0;
for(int i = 0; i < m; i++)
{
if( mask & ( (1<<i) ) )
sum += b[i+1];
}
v[sum].push_back( mask );
}
for(int i = 1; i <= n; i++)
{
if( v[a[i]].size() == 0 )
return cout << "NO" , 0;
}
rec();
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... |