제출 #684138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
684138		fuad27	은행 (IZhO14_bank)	C++17	100 / 100	110 ms	86604 KiB

bank

/*
 * Author: fuad720
 * Time: 2022-12-27 23:33
 * Lang: C++
*/
#ifndef LOCAL
	#pragma GCC optimize("O3,unroll-loops")
	#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif

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

using ll = long long;

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) FOR(i,0,b)
#define FORN(i,a,b) for(int i=int(b)-1;i>=a;i--)
#define per(i,b) FORN(i,0,b)

#define mkp make_pair
#define pb push_back
#define ep emplace_back
#define ff first
#define ss second
#define bg begin()
#define ed end()
#define sz(x) (int)x.size()
#define all(x) (x).bg,(x).ed
#define FIO ios_base::sync_with_stdio(0);\
	cin.tie(0);

template<class t> using vc=vector<t>;;
template<class t> using vvc=vc<vc<t>>;

using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi= vc<int>;
using vll= vc<ll>;


#ifdef LOCAL
#include "/home/fuad/cp/dbg.h"
#else
#define dbg(x...)
#endif

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngll(chrono::steady_clock::now().time_since_epoch().count());
int dp[20+1][(1<<20)];
vector<int> bt[20];
int calc(int n, int mask) {
	dbg(n,mask);
	if(n==0)return dp[n][mask]=1;
	if(dp[n][mask]!=-1)return dp[n][mask];
	dp[n][mask]=0;
	for(int to:bt[n-1]) {
		if((to&mask)==to)dp[n][mask]|=calc(n-1,mask-to);
	}
	dbg(n,mask,dp[n][mask]);
	return dp[n][mask];
}
void solve() {
	int n, m;
	cin >> n >> m;
	int a[n],b[m];
	rep(i,n)cin >> a[i];
	rep(i,m)cin >> b[i];
	rep(i,(1<<m)) {
		int sum=0;
		rep(j,m) {
			if((1<<j)&i)
				sum+=b[j];
		}
		rep(j,n) {
			if(sum==a[j]){
				bt[j].pb(i);
			}
		}
	}
	memset(dp,-1,sizeof dp);
	cout << (calc(n,(1<<m)-1)?"YES":"NO") << "\n";
}

int main () {
	FIO;
	int t=1;
	while(t--)
		solve();
}

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