| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1089165 | vjudge1 | Bank (IZhO14_bank) | C++17 | 4 ms | 5232 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.
/**
 *    data : 09.07.2024  
 *     
**/
#include <bits/stdc++.h>
// #include "algo/turnikmen.h"
using namespace std;
#define int long long
#define bitt __builtin_popcountll
#define bitzero __builtin_clz
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
void fReopen () {
        #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
        #endif
}
const int N = 2e5 + 4;
int n, m, a[N], b[N], ok, x; 
vector<int> used[N];
bool solve (int id, int res) {
        if (id == n) return 1;
        bool ok = 0;
        for (auto mask : used[a[id]]) {
                if (mask & res == 0) ok |= solve(id + 1, mask | res);
        }
        return ok;
}
signed main (/*  time : 9:17 AM   */) {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        fReopen();
        cin >> n >> m; 
        for (int i = 0; i < n; i++) {
                cin >> a[i];
        }
        for (int i = 0; i < m; i++) cin >> b[i];
        for (int mask = 0; mask < (1 << m); mask++) {
                int res = 0;
                for (int i = 0; i < m; i++) {
                        if (mask >> i & 1) res += b[i];
                }
                used[res].push_back(mask);
        }
        bool ok = 1;
        for (int i = 0; i < n && ok; i++) ok &= (used[a[i]].size() != 0);
        if (!ok) {
                cout << "NO\n";
                return 0;
        }
                
        // for (int i = 0; i < n; i++) {
        //         cout << a[i] << ' ';
        //         for (auto to : used[a[i]]) {
        //                 for (int j = 0; j < m; j++) {
        //                         cout << (to >> j & 1);
        //                 }
        //                 cout << ' ';
        //         }
        //         cout << endl;
        // }
        cout << (solve(0, 0) ? "YES\n" : "NO\n");
}
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... | ||||
