제출 #1102689

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1102689		MMJ	은행 (IZhO14_bank)	C++17	100 / 100	111 ms	4748 KiB

bank

#include<bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize ("Ofast,unroll-loops,trapv")
#pragma GCC target ("tune=native,avx2")
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;
 
#define f first
#define s second
#define mkpr make_pair
#define pque priority_queue
#define pb push_back
#define pf push_front
#define vec vector
#define pf push_front
#define Yes cout << "Yes\n";
#define YES cout << "YES\n";
#define No cout << "No\n";
#define NO cout << "NO\n";
#define em(x) (bool)(x).empty()
#define all(x) (x).begin(), (x).end()
#define tc int tc;cin >> tc; while(tc--) 
#define cps CLOCKS_PER_SEC

const int N = 1e5 + 5, P = 1e9 + 7;

int n, m, x, pr[N], a[N], b[N], dp[(1 << 20)];

int main() {
    ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		pr[i] = pr[i - 1] + a[i];
	}
  pr[n + 1] = P;
	for (int i = 0; i < m; i++)
		cin >> b[i];
		
	for (int i = 0; i < (1 << m); i++) {
		x = 0;
		for (int j = 0; j < m; j++)
			if ((i >> j) & 1)
				dp[i] = max(dp[i], dp[i ^ (1 << j)]), x += b[j];
		if (pr[dp[i] + 1] == x)
			dp[i]++;
	}
	if (dp[(1 << m) - 1] == n)
		YES
	else
		NO
}

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