# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017103 | daviedu | Bank (IZhO14_bank) | C++17 | 0 ms | 0 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;
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
struct P{
ll x, y;
};
void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }
// a little bit too slow
signed main(){
fastio;
int n, m;
cin >> n >> m;
vector<int> pay (n), notes (m);
for (auto &a: pay) cin >> a;
for (auto &a: notes) cin >> a;
vector<int> dp (1 << m, -1), r (1 << m);
int a, b;
bool ans=false;
for (int i=0; i<n; i++){
for (int mask=1; mask<(1<<m); mask++){
for (int j=0; j<m; j++){
if (!(mask & (1 << j))) continue;
if (dp[mask^(1<<j)] == i) {
dp[mask] = dp[mask^(1<<j)];
r[mask] = r[mask^(1<<j)]+notes[j];
break;
}
else if (dp[mask^(1<<j)] == i-1){
if (r[mask^(1<<j)]+notes[j] == pay[i]){
dp[mask] = i;
r[mask] = 0;
break;
}
dp[mask] = dp[mask^(1<<j)];
r[mask] = r[mask^(1<<j)]+notes[j]};
}
}
if (dp[mask].first == n-1) ans = true;
}
}
cout << (ans? "YES" : "NO") << '\n';
}