제출 #246502

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246502		aloo123	은행 (IZhO14_bank)	C++14	0 / 100	28 ms	512 KiB

bank

#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> os;
 
 
const ll INF = 1e12;
const ll N =(22); // TODO : change value as per problem
const ll MOD = 1e9+7;


ll a[N];
ll b[N];
vll nice[N];
bool dp[N][(1ll<<20) + 5];
void solve(){
    ll n,m;
    cin >> n >> m;    
    for(int i = 1;i<=n;i++) cin >> a[i];
    for(int i= 1;i<=m;i++) cin >> b[i];

    for(int i =1;i<=n;i++){
        ll sum = a[i];
        for(int j = 0;j<(1ll<<m);j++){
            ll cur = 0;
            string bin;
            for(int k =0;k<m;k++){
                if(j&(1ll<<k)){
                    cur += b[k+1];
                    bin += "1";
                }
                else bin+="0";
            }
            if(cur == sum) {
                // reverse(bin.begin(),bin.end());
                // cout << bin << endl;
                            nice[sum].pb(j);}
        }
    }

    for(int j = 0;j<(1ll<m);j++) dp[0][j] = true;
    for(int i =1;i<=n;i++){
        for(int j =0;j<(1ll<<m);j++){
            for(auto k:nice[a[i]]){
                // if(j&k == 0)
                    dp[i][j] |= dp[i-1][j^k];
            }
        }
    }
    bool ans = false;
    for(int i = 0;i<(1ll<<m);i++){
        ans |= dp[n][i];
    }
    if(ans) cout << "YES\n";
    else cout << "NO\n";
    // cout << ans << endl;
}

signed main(){

    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    

 
     ll tt=1;   
    while(tt--){    
        solve();
    }    
}

• Subtask 1: 0 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29