제출 #1002408

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002408		vjudge1	은행 (IZhO14_bank)	C++14	0 / 100	2 ms	348 KiB

bank

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

using ll = int;
using ld = long double;
using pll = pair<ll, ll>;

#define fi first
#define se second
#define sz(a) (ll)a.size()
#define all(a) (a).begin(), (a).end()

const ll N = 1e3 + 5;
const ll M = 100 + 5;
const ll blocksz = 450;
const ll mod = 1e9 + 7;
const ll inf = 1e18;

ll dp[25][1 << 20], a[21], b[21];
vector<ll> g[N];

void solve(){
	ll n, m; cin >> n >> m;
	for (int i = 1; i <= n; ++i){
		cin >> a[i];
	}
	for (int i = 1; i <= m; ++i){
		cin >> b[i];
	}
	for (int mask = 0; mask < (1 << m); ++mask){
		ll sum = 0;
		for (int i = 0; i < m; ++i){
			if (mask >> i & 1){
				sum += b[i + 1];
			}
		}
		g[sum].push_back(mask);
	}
	dp[0][0] = 1;
	for (int i = 0; i < n; ++i){
		for (int mask = 0; mask < (1 << m); ++mask){
			for (ll m : g[a[i + 1]]){
				if (m & mask) continue;
				dp[i + 1][mask | m] |= dp[i][mask];
			}
		}
	}
	for (int mask = 0; mask < (1 << m); ++mask){
		if (dp[n][mask]){
			cout << "YES"; return;
		}
	}
	cout << "NO";
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	freopen("bank.in", "r", stdin);
	freopen("bank.out", "w", stdout);
	ll t = 1; // cin >> t;
	while (t--){
		solve();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

bank.cpp:17:16: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   17 | const ll inf = 1e18;
      |                ^~~~
bank.cpp: In function 'int main()':
bank.cpp:59:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |  freopen("bank.in", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:60:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |  freopen("bank.out", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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