Submission #340638

#	Time	Username	Problem	Language	Result	Execution time	Memory
340638		amunduzbaev	Bank (IZhO14_bank)	C++14	0 / 100	1097 ms	86636 KiB

bank

/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 21;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, ans;
int tmp[(1 << N)][N];
vii make[N];
int a[N], b[N];

void bit(int x){
	for(int i=0;i<m;i++) cout<<((x & (1<<i)) ? 1:0);
	cout<<"\n";
}

void solve(){
	cin>>n>>m;
	for(int i=0;i<n;i++) cin>>a[i];
	for(int j=0;j<m;j++) cin>>b[j];
	
	for(int i=0;i<n;i++){
		for(int j=0;j<(1<<m);j++){
			int sum = 0;
			for(int l=0;l<m;l++) if(j & (1<<l)) sum += b[l];
			if(sum == a[i]) make[i].pb(j);
		}
	}

	
	for(int i=1;i<(1<<m);i++){
		for(int j=0;j<n;j++){
			tmp[i][j] = -mod;
		}
	}
	for(int j=0;j<n;j++) tmp[0][j] = 0;
	
	for(int i=0;i<(1 << m);i++){
		int tt = i;
		for(int j=0;j<n;j++){
			for(int l=0;l<sz(make[j]);l++){
				if((tt & make[j][l]) == make[j][l]){
					if(tmp[tt ^ make[j][l]][j]) continue;
					for(int k=0;k<n;k++) tmp[tt][j] = max(tmp[tt ^ make[j][l]][k] +1, tmp[tt][j]);
				}
			}
		}
	}
	for(int i=0;i<(1 << m);i++){
		for(int j=0;j<n;j++) 
			if(tmp[i][j] == n){
				cout<<"YES\n";
				return;
			}
	} cout<<"NO\n";	
	return;
}

/*

3 6
9 8 11
5 4 8 6 3 11

*/

int main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

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