Submission #381047

#	Time	Username	Problem	Language	Result	Execution time	Memory
381047		SavicS	Bank (IZhO14_bank)	C++14	71 / 100	203 ms	34832 KiB

bank

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 21;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, m;
int A[maxn];
int B[maxn];

bool dp[20][(1 << 20)];

vector<int> koje[20];

int main()
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    
	cin >> n >> m;
	ff(i,0,n - 1)cin >> A[i];
	ff(i,0,m - 1)cin >> B[i];
	
	ff(mask,0,(1 << m) - 1){
		int sum = 0;
		ff(i,0,m - 1){
			if(mask & (1 << i))sum += B[i];
		}
		ff(i,0,n - 1){
			if(A[i] == sum)koje[i].pb(mask);
		}
	}
	
	dp[0][0] = 1;
	ff(i,0,n - 1){
		for(auto msk : koje[i]){
			int mask = msk ^ ((1 << m) - 1);
			// one koje mi ne trebaju da bi mogao da dobijem A[i]
			int smask = mask;
			while(1){
		
				// smask koristim za prosle i - 1
				// msk koristim za i
						
				dp[i + 1][msk | smask] |= dp[i][smask];
						
				if(smask == 0)break;			
					
				smask = (smask - 1) & mask;
			}
		}
	}
	
	ff(mask,0,(1 << m) - 1){
		if(dp[n][mask] == 1)return cout << "YES", 0;
	}
	
	cout << "NO" << endl;
    return 0;
}
/**

1 5
8
4 2 5 1 3

// probati bojenje sahovski ili slicno

**/

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