oj.uz

Submission #671462

# Submission time Handle Problem Language Result Execution time Memory
671462 2022-12-13T05:34:06 Z Alihan_8 Bank (IZhO14_bank) C++17
52 / 100
 1000 ms 12612 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);
        }
    }
    for ( auto i: g ){
        if ( i.empty() ){
            cout << "NO\n";
            return 0;
        }
    }
    const int S = 1 << m;
    vector <vector<int>> dp(n+1, vector <int> (S));
    for ( int mask = 0; mask < S; mask++ ) dp[0][mask] = 1;
    for ( int i = 1; i <= n; i++ ){
        for ( int mask = 0; mask < S; mask++ ){
            if ( !dp[i-1][mask] ) continue;
            for ( auto val: g[i-1] ){
                if ( mask & val ) continue;
                dp[i][mask|val] = true;
            }
        }
    }
    if ( *max_element(all(dp[n])) ) 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
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 8 ms 700 KB Output is correct
5 Correct 55 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Execution timed out 1092 ms 12612 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
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 8 ms 700 KB Output is correct
5 Correct 55 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Execution timed out 1092 ms 12612 KB Time limit exceeded
9 Halted 0 ms 0 KB -