Submission #1273062

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273062		samarthkulkarni	은행 (IZhO14_bank)	C++20	52 / 100	1097 ms	21984 KiB

bank

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

// #pragma GCC target ("avx2")
// #pragma GCC optimize ("O3")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize("fast-math")

#define ll long long
#define ld long double
#define vi vector<ll>
#define endl "\n"
#define pr pair<ll, ll>
#define ff first 
#define ss second
#define all(x) x.begin(), x.end()
const int mod = 1e9+7;
void _p(ll a){cout<<a<<endl;}
void _p(string a){cout<<a<<endl;}
void _p(ld a) {cout<<a<<endl;}
template <class T>
void _p(vector<T> a){for(T val:a)cout<<val<<" ";cout<<endl;}
#define debug(x) cout<<#x<<" -> ";_p(x)

typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update > ordered_set;

vector<pr> move8 = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
vector<pr> move4 = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
vector<pr> move2 = {{0, 1}, {1, 0}};

// Segment tree (addition version)
struct Node {                                   // *
	ll val; bool upd;
	Node() {val = 0; upd = false;}
};

Node _merge(Node a1, Node a2) {                 // *
	Node ans;
	ans.val = a1.val + a2.val;
	return ans;
}

struct SegTree {
	int n; vi a;
	vector<Node> tree, lzy;
	SegTree (const vi& inp) {
		a = inp;
		n = a.size();
		tree.resize(4*n); lzy.resize(4*n);
	}

	void build (int id, int l, int r) {
		if (l == r) {
			tree[id].val = a[l];                // *
			return;
		}
		ll mid = (l + r) >> 1;
		build(2*id, l, mid);
		build(2*id + 1, mid+1, r);

		tree[id] = _merge(tree[2*id], tree[2*id + 1]);
	}

	void push(int id, int l, int r) {  
		if (!lzy[id].upd) return;
		tree[id].val += (r - l + 1) * lzy[id].val;         // * (assign or add)
		if (l != r) {
			lzy[2*id].val += lzy[id].val, lzy[2*id+1].val += lzy[id].val;   // * (assign or add)
			lzy[2*id].upd = true, lzy[2*id + 1].upd = true;
		}
		lzy[id].val = 0; lzy[id].upd = false;
	}

	Node query (int id, int l, int r, int L, int R) {
		push(id, l, r);
		if (L > r || l > R) return Node(); 
		if (l >= L && r <= R) { return tree[id]; }
		int mid = (l + r) >> 1;
		return _merge(query(2*id, l, mid, L, R), query(2*id+1, mid+1, r, L, R));
	}

	void update(int id, int l, int r, int L, int R, ll V) {
		push(id, l, r);
		if (L > r || l > R) return;
		if (l >= L && r <= R) {
			lzy[id].val += V, lzy[id].upd = true;      // * (assign or add)
			push(id, l, r); 
			return;
		}
		int mid = (l + r) >> 1;
		update(2*id, l, mid, L, R, V);
		update(2*id + 1, mid+1, r, L, R, V);
		tree[id] = _merge(tree[2*id], tree[2*id+1]);
	}

	// over-ridden functions
	void build() {build(1, 0, n-1);}
	Node query(int l, int r) {return query(1, 0, n-1, l, r);}
	void update(int l, int r, ll V) { update(1, 0, n-1, l, r, V);}
};

void solution();
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solution();
    return 0;
}


ll a[21], bankNotes[20];
bool dp[1<<20][21];
vi ValidSubMask[21];


void solution() {
    ll n, m; cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >>a[i];
    for (int i = 0; i < m; i++) cin >> bankNotes[i];

    for (int i = 0; i < (1 << 20); i++) dp[i][0] = 1;



    for (int i = 1; i <= n; i++) {
    	for (int mask = 0; mask < (1 << m); mask++) {
    		ll val = a[i];
    		for (int j = 0; j < m; j++) {
    			if (!(mask & (1 << j))) continue;
    			val -= bankNotes[j];
    		}

    		if (val == 0) ValidSubMask[i].push_back(mask);
    	}


    }


    for (int i = 1; i <= n; i++) {
    	for (int mask = 0; mask < (1 << m); mask++) {
    		for (auto submask : ValidSubMask[i]) {
    			if ((submask & mask) != submask) continue;
    			dp[mask][i] = dp[mask][i] | dp[mask ^ submask][i-1];
    			if (dp[mask][i]) break;
    		}
    	}
    }


    if (dp[(1 << m)-1][n]) cout << "YES" << endl;
    else cout << "NO" << endl;




}

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