Submission #1288391

#	Time	Username	Problem	Language	Result	Execution time	Memory
1288391		muhammad-mutahir	Bank (IZhO14_bank)	C++20	25 / 100	24 ms	12420 KiB

bank

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e6+3;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;
bitset<(1<<20)+10> dp[21];
vector<int> sum[1001];
void solve(int testcase_number){
    cin>>n>>m;

	int A[n];		
	int BK[m];
	for(int i =0 ;i<n;i++){
		cin>>A[i];
	}
	for(int i = 0;i<m;i++){
		cin>>BK[i];
	}
	// cout<<dp[0]._Find_first()<<endl;
	dp[0][0] = 1;
	
	for(int mask = 1;mask<(1<<m);mask++){
		int su = 0;

		for(int j = 0;j<m;j++){
			su+=BK[j]*((mask&(1<<j)) != 0);
		}
		
		if(su<=1000){
			sum[su].pb(mask);
		}
		
	}
	for(int i = 0;i<n;i++){
		for(int k = dp[i]._Find_first();k<(1<<m);k = dp[i]._Find_next(k)){
			
			for(int j:sum[A[i]]){
				if((j&k) == 0 ){
					dp[i+1][k|j] = 1;
				}
			}
		}
	}
	// cout<<dp[n]<<endl;
	if(dp[n]._Find_first() < (1<<m+10)){
		cout<<"YES"<<endl;
	}
	else{
		cout<<"NO"<<endl;
	}
// 	
	// for(int mask = 0;mask<(1<<m);mask++){
		// if(dp[mask][n]){
			// // cout<<i<<endl;
			// cout<<"YES"<<endl;
			// return;
		// }
	// }
	// cout<<"NO"<<endl;

}








signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);
    
    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

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