제출 #88301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
88301		dimash241	은행 (IZhO14_bank)	C++17	100 / 100	229 ms	14716 KiB

bank

# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (int i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int a[2020], b[2020];
int sum;
bool was[22][(1 << 20) + 12];
vector < int > g[21];

void rec (int v, int used) {
	if (v > n) {
		cout << "YES";
		exit(0);
	}

	if (was[v][used]) return ;
	was[v][used] = 1;
	for (auto to : g[v]) if ((used & to) == 0) {
		rec(v + 1, (used ^ to));	
	}
}

int main () {
	cin >> n >> m;
	For (i, 1, n) {
		cin >> a[i];
	}

	For (i, 1, m) {
		cin >> b[i];
	}

	for (int mask = 1; mask < (1 << m); mask ++) {
		sum = 0;
		for (int j = 0; j < m; j ++) {
			if (mask & (1 << j))
				sum += b[j + 1];
		} 
		For (i, 1, n) {
			if (a[i] == sum) g[i].pb(mask);
		}
	}

	rec (1, 0);
	cout << "NO";


    return Accepted;
}

// Coded By OB

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