제출 #684480

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
684480		pragmatist	은행 (IZhO14_bank)	C++17	100 / 100	918 ms	58972 KiB

bank

/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/

#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")

#include<bits/stdc++.h>
 
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"

using namespace std;
using pii = pair<int, int>;

const int N = (int)3e5 + 7; // make sure this is right
const int M = (int)1e6 + 7;
const int inf = (int)1e9 + 7;
const ll INF = (ll)3e18 + 7; 
const ll MOD = (ll)998244353; // make sure this is right

bool bit(int x, int i) {
	return x >> i & 1;
}

pii dir[] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int n, m, a[21], b[20];
vector<int> pos[21];
int dp[21][1 << 20], r[1 << 20];

void solve() {
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	for(int i = 0; i < m; ++i) {
		cin >> b[i];
	}                   
	for(int mask = 0; mask < (1 << m); ++mask) {
		int cur = 0;
		for(int i = 0; i < m; ++i) {
			if(bit(mask, i)) {
				cur += b[i];
			} else {
				r[mask] |= (1 << i);
			}
		}
		for(int i = 1; i <= n; ++i) {
			if(a[i] == cur) {
				pos[i].pb(mask);
			}
		}
	}                         
	dp[0][0] = 1;
	for(int i = 1; i <= n; ++i) {
		for(auto mask : pos[i]) {
			int e = r[mask];
			for(int sub = e; ; sub = (sub - 1) & e) {
				if(dp[i - 1][sub]) {
					dp[i][mask | sub] = 1;
				}
				if(sub == 0) break;	
			}
		}
	}
	for(int i = 0; i < (1 << m); ++i) {
		if(dp[n][i]) {
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";
}

signed main() {	
	ios_base::sync_with_stdio(0);
	cin.tie(0); 
	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
	 	//cout << "Case #" << i << ": ";
		solve();
	}
	return 0;
}

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