제출 #1275107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275107		almaz	은행 (IZhO14_bank)	C++17	71 / 100	1096 ms	62532 KiB

bank

#include <iostream>
#include <vector>
#include <set>
#include <unordered_map>
using namespace std;

#pragma warning(disable:4996)
// #define int long long
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ar array

const int MOD = 1e9 + 7,INF = 1e9, N = 2e5 + 5;
/*
5 2
1 2 2
2 3 2	
3 4 2
4 5 2

*/


void solve(){
	int n , m;
	cin >> n >> m;
	
	vector <int> a(n) , b(m);
	
	for(int i = 0;i < n;i++){
		cin >> a[i];
	}
	for(int i = 0;i < m;i++){
		cin >> b[i];
	}
	
	unordered_map <int, set <int>> mp;
	
	for(int i = 0;i < (1 << m);i++){
		int sum = 0;
		for(int j = 0;j < m;j++){
			if(1 & (i >> j)){
				sum += b[j];
			}
		}
		mp[sum].insert(i);
	}
	set <int> g;
	g.insert(0);
	
	
	for(int i = 0;i < n;i++){
		set <int> cnt;
		for(int j : mp[a[i]]){
			for(int k : g){
				if((k & j) == 0){
					cnt.insert(k | j);
				} 
			}
		}
		swap(cnt , g);
	}
	
	int f = 0;
	if(g.size() > 0){
		f = 1;
	}
	
	if(f){
		cout<<"YES"<<endl;
	}
	else{
		cout<<"NO"<<endl;
	}
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int ti = 1;
    while (ti--) {
		solve();
    }
}

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