oj.uz

Submission #212942

# Submission time Handle Problem Language Result Execution time Memory
212942 2020-03-24T15:04:09 Z islingr Bank (IZhO14_bank) C++14
100 / 100
 276 ms 82456 KB 
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b) - 1; i >= (a); --i)
#define trav(x, v) for (auto &x : v)
#define ff first
#define ss second

using ll = int64_t;

template<class T> bool ckmin(T &a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T &a, const T& b) { return a < b ? a = b, 1 : 0; }

const int N = 20;
int n, m, a[N], b[N];
vector<int> r[N];
int f[N][1 << N];

bool solve(int S, int i) {
	if (i == 0) return true;
	if (S == 0) return false;
	--i;
	auto &h = f[i][S];
	if (h != -1) return h;
	trav(x, r[i])
		if ((x & S) == x)
			if (solve(S & ~x, i))
			return h = true;
	return h = false;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> m;
	rep(i, 0, n) cin >> a[i];
	rep(i, 0, m) cin >> b[i];
	rep(S, 0, 1 << m) {
		int sum = 0;
		rep(j, 0, m) if (S & 1 << j) sum += b[j];
		rep(i, 0, n) if (sum == a[i]) r[i].emplace_back(S);
	}
	rep(S, 0, 1 << m) rep(i, 0, n) f[i][S] = -1;
	cout << (solve((1 << m) - 1, n) ? "YES" : "NO");
}

Compilation message

bank.cpp: In function 'bool solve(int, int)':
bank.cpp:31:13: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    return h = true;
           ~~^~~~~~
bank.cpp:32:11: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  return h = false;
         ~~^~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 71 ms 4448 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 70 ms 4472 KB Output is correct
9 Correct 75 ms 4472 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 896 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 8 ms 1280 KB Output is correct
5 Correct 7 ms 1024 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 6 ms 896 KB Output is correct
11 Correct 7 ms 1280 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 71 ms 4448 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 70 ms 4472 KB Output is correct
9 Correct 75 ms 4472 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 896 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 1024 KB Output is correct
23 Correct 8 ms 1280 KB Output is correct
24 Correct 7 ms 1024 KB Output is correct
25 Correct 7 ms 640 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 896 KB Output is correct
29 Correct 6 ms 896 KB Output is correct
30 Correct 7 ms 1280 KB Output is correct
31 Correct 74 ms 8584 KB Output is correct
32 Correct 82 ms 12768 KB Output is correct
33 Correct 95 ms 29052 KB Output is correct
34 Correct 127 ms 41336 KB Output is correct
35 Correct 136 ms 45444 KB Output is correct
36 Correct 253 ms 82400 KB Output is correct
37 Correct 74 ms 8568 KB Output is correct
38 Correct 81 ms 16760 KB Output is correct
39 Correct 108 ms 33144 KB Output is correct
40 Correct 129 ms 41352 KB Output is correct
41 Correct 261 ms 82456 KB Output is correct
42 Correct 94 ms 20832 KB Output is correct
43 Correct 102 ms 33144 KB Output is correct
44 Correct 180 ms 61920 KB Output is correct
45 Correct 80 ms 12640 KB Output is correct
46 Correct 96 ms 25212 KB Output is correct
47 Correct 178 ms 61912 KB Output is correct
48 Correct 71 ms 4472 KB Output is correct
49 Correct 77 ms 4488 KB Output is correct
50 Correct 252 ms 82456 KB Output is correct
51 Correct 141 ms 41464 KB Output is correct
52 Correct 224 ms 41464 KB Output is correct
53 Correct 131 ms 41464 KB Output is correct
54 Correct 248 ms 82436 KB Output is correct
55 Correct 254 ms 82424 KB Output is correct
56 Correct 258 ms 82392 KB Output is correct
57 Correct 276 ms 82424 KB Output is correct
58 Correct 234 ms 78328 KB Output is correct