제출 #340808

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
340808		amunduzbaev	은행 (IZhO14_bank)	C++14	71 / 100	1094 ms	600 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 used[(1 << N)];
vii make[N];
int a[N], b[N], ok = 1;

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

void check(int k, int mask = 0){
	if(used[mask]) return;
	used[mask] = 1;
	if(k == n){
		cout<<"YES\n";
		ok = 0;
		return;
	}
	for(auto x:make[k]){
		//if(m-k > m-cnt(mask)) return;
		if((x & mask) == 0) check(k+1, mask | x);
		if(ok == 0) return;
	}
}

void solve(){
	cin>>n>>m;
	ll suma = 0, sumb = 0;
	for(int i=0;i<n;i++) { cin>>a[i]; suma += a[i]; }
	for(int j=0;j<m;j++) { cin>>b[j]; sumb += b[j]; }
	
	if(suma > sumb){
		cout<<"NO\n";
		return;
	}
	
	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);
		}
	}
	check(0);
	if(ok == 0) return;
	cout<<"NO\n";	
	return;
}

/*

2 2
10 10
10 10

1 20
1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

1 3
10 
5 5 5

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: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 0 / 29