This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// https://oj.uz/problem/view/IZhO14_bank
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
vector<int> mp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for ( int i=0; i<n; i++ ) cin >> a[i];
for ( int i=0; i<m; i++ ) cin >> b[i];
for ( int s=1; s<1<<m; s++ ) {
int res = 0;
for ( int i=0; i<m; i++ ) {
if ( s>>i&1 ) res += b[i];
}
if ( res<N ) mp[res].push_back(s);
}
set<int> avail;
avail.insert((1<<m) - 1);
for ( int i=0; i<n; i++ ) {
set<int> navail;
bool ok = false;
for ( int t:mp[a[i]] ) {
for ( int s:avail ) {
if ( (t&s)==t) {
if ( (s^t)>0&&navail.count(s^t)==0 )
navail.insert(s^t);
ok = true;
}
}
}
if ( !ok ) {
cout << "NO" << '\n';
return 0;
}
avail = navail;
}
cout << "YES" << '\n';
return 0;
}
# | 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... |