# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96224 | 2019-02-07T09:25:58 Z | Kastanda | Bank (IZhO14_bank) | C++11 | 69 ms | 4572 KB |
#include<bits/stdc++.h> using namespace std; const int N = 20, MXN = (1 << N) + 5; int n, m, A[N], B[N], sum[MXN]; vector < int > vec[N]; multiset < int > SS; void Go(int mask, int i) { if (i == n) { printf("YES\n"); exit(0); } for (int mask2 : vec[i]) if ((mask & mask2) == 0) Go(mask ^ mask2, i + 1); } int main() { scanf("%d%d", &n, &m); for (int i = 0; i < n; i++) scanf("%d", &A[i]), SS.insert(A[i]); for (int i = 0; i < m; i++) { scanf("%d", &B[i]); if (SS.count(B[i])) SS.erase(SS.lower_bound(B[i])), i --, m --; } n = 0; for (int a : SS) A[n ++] = a; if (n + n > m) return !printf("NO\n"); for (int i = 1; i < (1 << m); i++) { sum[i] = sum[i ^ (1 << __builtin_ctz(i))] + B[__builtin_ctz(i)]; for (int j = 0; j < n; j++) if (sum[i] == A[j]) vec[j].push_back(i); } Go(0, 0); return !printf("NO\n"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 8 ms | 4344 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 10 ms | 4472 KB | Output is correct |
9 | Correct | 9 ms | 4344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 252 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 3 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 376 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 420 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 380 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 8 ms | 4344 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 10 ms | 4472 KB | Output is correct |
9 | Correct | 9 ms | 4344 KB | Output is correct |
10 | Correct | 2 ms | 256 KB | Output is correct |
11 | Correct | 2 ms | 252 KB | Output is correct |
12 | Correct | 2 ms | 256 KB | Output is correct |
13 | Correct | 2 ms | 256 KB | Output is correct |
14 | Correct | 2 ms | 376 KB | Output is correct |
15 | Correct | 2 ms | 256 KB | Output is correct |
16 | Correct | 2 ms | 376 KB | Output is correct |
17 | Correct | 3 ms | 376 KB | Output is correct |
18 | Correct | 2 ms | 376 KB | Output is correct |
19 | Correct | 2 ms | 376 KB | Output is correct |
20 | Correct | 3 ms | 504 KB | Output is correct |
21 | Correct | 2 ms | 376 KB | Output is correct |
22 | Correct | 2 ms | 376 KB | Output is correct |
23 | Correct | 2 ms | 376 KB | Output is correct |
24 | Correct | 2 ms | 256 KB | Output is correct |
25 | Correct | 2 ms | 420 KB | Output is correct |
26 | Correct | 2 ms | 376 KB | Output is correct |
27 | Correct | 2 ms | 376 KB | Output is correct |
28 | Correct | 2 ms | 380 KB | Output is correct |
29 | Correct | 2 ms | 376 KB | Output is correct |
30 | Correct | 2 ms | 376 KB | Output is correct |
31 | Correct | 9 ms | 4472 KB | Output is correct |
32 | Correct | 11 ms | 4572 KB | Output is correct |
33 | Correct | 15 ms | 4480 KB | Output is correct |
34 | Correct | 8 ms | 2296 KB | Output is correct |
35 | Correct | 6 ms | 1400 KB | Output is correct |
36 | Correct | 2 ms | 376 KB | Output is correct |
37 | Correct | 10 ms | 4472 KB | Output is correct |
38 | Correct | 10 ms | 4472 KB | Output is correct |
39 | Correct | 2 ms | 376 KB | Output is correct |
40 | Correct | 16 ms | 4472 KB | Output is correct |
41 | Correct | 2 ms | 376 KB | Output is correct |
42 | Correct | 69 ms | 4472 KB | Output is correct |
43 | Correct | 15 ms | 4472 KB | Output is correct |
44 | Correct | 2 ms | 256 KB | Output is correct |
45 | Correct | 10 ms | 4472 KB | Output is correct |
46 | Correct | 13 ms | 4344 KB | Output is correct |
47 | Correct | 2 ms | 376 KB | Output is correct |
48 | Correct | 8 ms | 4472 KB | Output is correct |
49 | Correct | 10 ms | 4472 KB | Output is correct |
50 | Correct | 2 ms | 376 KB | Output is correct |
51 | Correct | 9 ms | 2396 KB | Output is correct |
52 | Correct | 16 ms | 4476 KB | Output is correct |
53 | Correct | 3 ms | 632 KB | Output is correct |
54 | Correct | 2 ms | 380 KB | Output is correct |
55 | Correct | 2 ms | 256 KB | Output is correct |
56 | Correct | 2 ms | 252 KB | Output is correct |
57 | Correct | 2 ms | 376 KB | Output is correct |
58 | Correct | 2 ms | 376 KB | Output is correct |