oj.uz

Submission #671465

# Submission time Handle Problem Language Result Execution time Memory
671465 2022-12-13T05:39:54 Z Alihan_8 Bank (IZhO14_bank) C++17
100 / 100
 709 ms 172792 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;
    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];
        }
        for ( int j = 0; j < n; j++ ){
            if ( a[j] == cnt ) g[j].pb(mask);
        }
    }
    const int S = 1 << m;
    vector <vector<int>> dp(n, vector <int> (S)), used(n+1, vector <int> (S));
    function <int(int,int)> dfs = [&](int mask, int pos){
        if ( pos == n ) return 1;
        if ( used[pos][mask] ) return dp[pos][mask];
        used[pos][mask] = 1;
        int &res = dp[pos][mask]; res = 0;
        for ( auto val: g[pos] ){
            if ( (val & mask) ^ val ) continue;
            if ( dfs(mask^val, pos+1) ) res = 1;
        }
        return res;
    };
    dfs(S-1, 0);
    if ( *max_element(all(dp[n-1])) ) cout << "YES";
    else 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);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 720 KB Output is correct
5 Correct 65 ms 16688 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 63 ms 16736 KB Output is correct
9 Correct 62 ms 16684 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 1620 KB Output is correct
4 Correct 3 ms 2132 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 2 ms 1364 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 2132 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 720 KB Output is correct
5 Correct 65 ms 16688 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 63 ms 16736 KB Output is correct
9 Correct 62 ms 16684 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 1620 KB Output is correct
23 Correct 3 ms 2132 KB Output is correct
24 Correct 2 ms 1664 KB Output is correct
25 Correct 1 ms 980 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 2 ms 1364 KB Output is correct
29 Correct 2 ms 1364 KB Output is correct
30 Correct 2 ms 2132 KB Output is correct
31 Correct 70 ms 25008 KB Output is correct
32 Correct 136 ms 33280 KB Output is correct
33 Correct 99 ms 65896 KB Output is correct
34 Correct 103 ms 90532 KB Output is correct
35 Correct 109 ms 98784 KB Output is correct
36 Correct 152 ms 172704 KB Output is correct
37 Correct 71 ms 24884 KB Output is correct
38 Correct 78 ms 41340 KB Output is correct
39 Correct 120 ms 74148 KB Output is correct
40 Correct 103 ms 90568 KB Output is correct
41 Correct 143 ms 172680 KB Output is correct
42 Correct 88 ms 49612 KB Output is correct
43 Correct 105 ms 74212 KB Output is correct
44 Correct 125 ms 131628 KB Output is correct
45 Correct 73 ms 33096 KB Output is correct
46 Correct 88 ms 57772 KB Output is correct
47 Correct 126 ms 131600 KB Output is correct
48 Correct 65 ms 16872 KB Output is correct
49 Correct 63 ms 16688 KB Output is correct
50 Correct 410 ms 172736 KB Output is correct
51 Correct 105 ms 90720 KB Output is correct
52 Correct 106 ms 90608 KB Output is correct
53 Correct 709 ms 90684 KB Output is correct
54 Correct 491 ms 172792 KB Output is correct
55 Correct 395 ms 172736 KB Output is correct
56 Correct 454 ms 172768 KB Output is correct
57 Correct 469 ms 172768 KB Output is correct
58 Correct 436 ms 164556 KB Output is correct