제출 #733967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
733967		OrazB	은행 (IZhO14_bank)	C++14	100 / 100	175 ms	4484 KiB

bank

/*
ID: orazbeg1
LANG: C++
TASK: fact4
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 2000005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

int dp[N], p[N], b[N];

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		int x;
		cin >> x;
		p[i] = p[i-1]+x;
	}	
	for (int i = 1; i <= m; i++){
		cin >> b[i];
	}
	dp[0] = 1;
	for (int i = 1; i < (1<<m); i++){
		int sum = 0;
		for (int j = 1; j <= m; j++){
			if ((1<<(j-1))&i) sum += b[j];
		}
		int pos=-1;
		for (int j = 1; j <= n; j++){
			if (p[j] >= sum){pos=j;break;}
		}
		if (pos==-1)continue;
		for (int j = 1; j <= m; j++){
			if ((1<<(j-1))&i and b[j] <= sum-p[pos-1]) dp[i] |= dp[i-(1<<(j-1))];
		}
		if (sum == p[n] and dp[i]) return cout << "YES", 0;
	}
	cout << "NO";
}	

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