oj.uz

Submission #745131

# Submission time Handle Problem Language Result Execution time Memory
745131 2023-05-19T12:22:57 Z vjudge1 Bank (IZhO14_bank) C++17
0 / 100
 2 ms 392 KB 
#include <bits/stdc++.h>

using namespace std;

#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) + (m) - 1) / (m))
#define add_mod(a, b, m) (((a % m) + (b % m)) % m)
#define sub_mod(a, b, m) (((a % m) - (b % m) + m) % m)
#define mul_mod(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define EPS 1e-9
constexpr int INF = 1 << 30, Mod = 1e9 + 7;
constexpr ll LINF = 1LL << 62;
#define PI acos(-1)
template < typename T = int > using Pair = pair < T, T >;
vector < string > RET = {"NO", "YES"};

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x : v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) { 
    for (const T &x : v) out << x << ' '; 
    return out;
}

int n, m, pick;
vector < int > a, b;
vector < vector < int > > dp, adj;

void get_adj(int x, int id, int idx){
    if(x == 0) {
        adj[id].push_back(pick);
        return;
    }
    if(idx == m) return;
    get_adj(x, id, idx + 1);
    pick ^= (1 << idx);
    get_adj(x - b[idx], id, idx + 1);
    pick ^= (1 << idx);
}

int can_do(int idx, int mask){
    if(idx == n) return true;
    int &ret = dp[idx][mask];
    if(~ret) return ret;
    ret = false;
    for(auto& x : adj[idx]){
        if(x & mask) continue;
        if(can_do(idx + 1, mask | x))
            return ret = true;
    }
    return ret;
}

void build_adj(){
    adj = vector < vector < int > > (n);
    for(int i = 0; i < n; i++){
        pick = 0;
        get_adj(a[i], i, 0);
    }
}

void Solve(){
    cin >> n >> m;
    a = vector < int > (n);
    b = vector < int > (m);
    cin >> a >> b;
    dp = vector < vector < int > > (n + 5, vector < int > (1 << m, -1));
    build_adj();
    cout << RET[can_do(0, 0)] << '\n'; 
}

int main(){
    freopen("bank.in", "r", stdin);
    freopen("bank.out", "w", stdout);
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int test_cases = 1;
    // cin >> test_cases;
    for(int tc = 1; tc <= test_cases; tc++){
        // cout << "Case #" << tc << ": ";
        Solve();
    }
    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:83:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     freopen("bank.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:84:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     freopen("bank.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -