제출 #396814

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396814		SavicS	은행 (IZhO14_bank)	C++14	0 / 100	4 ms	524 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[21][(1 << 21)];
 
vector<int> koje[1005];
 
int zbir[maxn];
 
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];
	
	zbir[0] = 0;
	ff(mask,1,(1 << m) - 1){
		zbir[mask] = zbir[mask & (mask - 1)] + B[__builtin_ctz(mask)];
		koje[zbir[mask]].pb(mask);
	}
	
	dp[0][0] = 1;
	ff(i,0,n - 1){

		for(auto msk : koje[A[i]]){
			int mask = ((1 << m) - 1) ^ msk; // ovo mi je ostalo
			
			for(int smask = mask; smask >= 0; smask = (smask - 1) & mask){
				dp[i + 1][msk | smask] |= dp[i][smask];
				if(smask == 0)break;
			}
		}
		
	}
	
	ff(mask,0,(1 << m) - 1){
		if(dp[n][mask])return cout << "YES", 0;
	}
	cout << "NO";
	
    return 0;
}
/**
 
1 5
8
4 2 5 1 3
 
// probati bojenje sahovski ili slicno
 
**/
 

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