제출 #1127850

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1127850		zhasyn	은행 (IZhO14_bank)	C++17	19 / 100	57 ms	328 KiB

bank

#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 3 * 1e5 + 100, M = 500 + 10, len = 315, inf = 1e18;
const ll mod = 998244353;
ll um(ll a, ll b){
	return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll bp(ll x, ll step){
	ll res = 1;
	while(step){
		if(step & 1) res = um(res, x);
		x = um(x, x);
		step /= 2;
	}
	return res;
}
ll inv(ll x){
	return bp(x, mod - 2);
}
int a[N], b[N];
int main() {
	//ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	for(int i = 0; i < m; i++){
		cin >> b[i];
	}
	bool can = false;
	for(int mask = 0; mask < (1 << m); mask++){
		int cur = 0;
		for(int dig = 0; dig < m; dig++){
			if((mask & (1 << dig)) > 0) cur += b[dig];
		}
		if(cur == a[0]) can = true;
	}
	if(can) cout << "YES";
	else cout << "NO";
  return 0;
}

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