Submission #671448

# Submission time Handle Problem Language Result Execution time Memory
671448 2022-12-13T05:17:06 Z Alihan_8 Bank (IZhO14_bank) C++17
71 / 100
1000 ms 15104 KB
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; cin >> n >> m;
    vector <int> a(n), b(m);
    for ( auto &i: a ) cin >> i;
    for ( auto &i: b ) cin >> i;
    const int N = 2e4+1;
    vector <int> g[N];
    for ( int mask = 1; mask < (1 << m); mask++ ){
        int cnt = 0;
        for ( int i = 0; i < m; i++ ){
            if ( mask >> i & 1 ) cnt += b[i];
        }
        g[cnt].pb(mask);
    }
    function <void(int,int)> dfs = [&](int mask, int pos){
        if ( pos == n ){
            cout << "YES\n";
            exit(0);
        }
        for ( auto val: g[a[pos]] ){
            if ( (mask^val) & val ) continue;
            dfs(mask^val, pos+1);
        }
    };
    dfs((1 << m)-1, 0);
    cout << "NO";

    cout << '\n';
}

Compilation message

bank.cpp: In function 'void IO(std::string)':
bank.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 67 ms 12788 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 63 ms 11464 KB Output is correct
9 Correct 65 ms 12108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 784 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 908 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 916 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 67 ms 12788 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 63 ms 11464 KB Output is correct
9 Correct 65 ms 12108 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 784 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 2 ms 908 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 2 ms 916 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 1 ms 852 KB Output is correct
31 Correct 71 ms 12784 KB Output is correct
32 Correct 64 ms 12364 KB Output is correct
33 Correct 68 ms 12548 KB Output is correct
34 Correct 75 ms 13304 KB Output is correct
35 Correct 74 ms 15104 KB Output is correct
36 Correct 73 ms 14184 KB Output is correct
37 Correct 73 ms 15076 KB Output is correct
38 Correct 71 ms 14512 KB Output is correct
39 Correct 64 ms 10120 KB Output is correct
40 Correct 67 ms 13576 KB Output is correct
41 Correct 69 ms 13224 KB Output is correct
42 Correct 138 ms 11256 KB Output is correct
43 Correct 72 ms 14032 KB Output is correct
44 Correct 76 ms 15012 KB Output is correct
45 Correct 65 ms 12296 KB Output is correct
46 Correct 68 ms 14096 KB Output is correct
47 Correct 75 ms 13848 KB Output is correct
48 Correct 65 ms 11876 KB Output is correct
49 Correct 63 ms 12120 KB Output is correct
50 Correct 64 ms 10464 KB Output is correct
51 Correct 68 ms 11832 KB Output is correct
52 Correct 64 ms 10012 KB Output is correct
53 Correct 64 ms 10352 KB Output is correct
54 Correct 66 ms 10544 KB Output is correct
55 Correct 65 ms 10368 KB Output is correct
56 Correct 65 ms 11756 KB Output is correct
57 Execution timed out 1088 ms 11760 KB Time limit exceeded
58 Halted 0 ms 0 KB -