Submission #922251

#	Time	Username	Problem	Language	Result	Execution time	Memory
922251		Baizho	Bank (IZhO14_bank)	C++14	19 / 100	47 ms	1488 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")


typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back

//const int mod = ll(1e9) + 7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const int mod = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5) + 11;
const long long inf = 1e9;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }

ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}

int n, m, a[23], b[23], cnt[1005];
bool dp[(1 << 20) + 10], dp1[(1 << 20) + 10];
vector<int> ways[30];

void Baizho() {
	cin>>n>>m;
	for(int i = 1; i <= n; i ++) {
		cin>>a[i];
		cnt[a[i]] ++;
	}
	for(int i = 1; i <= m; i ++) cin>>b[i];
	for(int i = 1; i <= n; i ++) {
		for(int mask = 1; mask < (1 << m); mask ++) {
			int sum = 0;
			for(int j = 1; j <= m; j ++) if(mask & (1 << j - 1)) sum += b[j];
			if(sum == a[i]) ways[i].pb(mask);
		}
	}
	for(auto way : ways[1]) dp[way] = 1;
	for(int i = 2; i <= n; i ++) {
		for(int mask = 0; mask < (1 << m); mask ++) dp1[i] = 0;
		for(int mask = 0; mask < (1 << m); mask ++) {
			if(!dp[mask]) continue;
			for(auto way : ways[i]) {
				if((mask & way) == 0) dp1[mask + way] = 1;
			}
		}
		for(int mask = 0; mask < (1 << m); mask ++) dp[mask] = dp1[mask];
	}
	bool ok = 0;
	for(int i = 0; i < (1 << m); i ++) {
		ok |= dp[i];
		if(ok) break;
	}
	if(ok) cout<<"YES\n";
	else cout<<"NO\n";      
}
 
signed main() {		
// 	Freopen("hps");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;

    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message (stderr)

bank.cpp: In function 'void Baizho()':
bank.cpp:48:51: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   48 |    for(int j = 1; j <= m; j ++) if(mask & (1 << j - 1)) sum += b[j];
      |                                                 ~~^~~

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