# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
969230 |
2024-04-24T17:28:23 Z |
biank |
Bank (IZhO14_bank) |
C++14 |
|
66 ms |
10844 KB |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 20;
const int MAX_S = 1001;
int sum[1 << MAX_N];
bool vis[1 << MAX_N];
vector<int> adj[MAX_S];
int a[MAX_N], b[MAX_N], n;
bool dfs(int i, int u) {
if (i == n) return true;
vis[u] = true;
for (int v : adj[a[i]]) {
if ((u & v) == v && !vis[u ^ v] && dfs(i + 1, u ^ v)) return true;
}
return false;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int mask = 1; mask < 1 << m; mask++) {
if (mask != 0) {
int i = __builtin_ctz(mask);
sum[mask] = sum[mask ^ (1 << i)] + b[i];
}
if (sum[mask] < MAX_S) {
adj[sum[mask]].push_back(mask);
}
}
if (dfs(0, (1 << m) - 1)) cout << "YES\n";
else cout << "NO\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
604 KB |
Output is correct |
5 |
Correct |
9 ms |
10844 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
7 ms |
10076 KB |
Output is correct |
9 |
Correct |
9 ms |
10588 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
604 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
604 KB |
Output is correct |
5 |
Correct |
1 ms |
604 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
604 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
604 KB |
Output is correct |
5 |
Correct |
9 ms |
10844 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
7 ms |
10076 KB |
Output is correct |
9 |
Correct |
9 ms |
10588 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
0 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
1 ms |
604 KB |
Output is correct |
22 |
Correct |
0 ms |
348 KB |
Output is correct |
23 |
Correct |
0 ms |
604 KB |
Output is correct |
24 |
Correct |
1 ms |
604 KB |
Output is correct |
25 |
Correct |
1 ms |
348 KB |
Output is correct |
26 |
Correct |
1 ms |
604 KB |
Output is correct |
27 |
Correct |
1 ms |
348 KB |
Output is correct |
28 |
Correct |
1 ms |
344 KB |
Output is correct |
29 |
Correct |
0 ms |
348 KB |
Output is correct |
30 |
Correct |
0 ms |
604 KB |
Output is correct |
31 |
Correct |
7 ms |
9820 KB |
Output is correct |
32 |
Correct |
7 ms |
10332 KB |
Output is correct |
33 |
Correct |
5 ms |
5212 KB |
Output is correct |
34 |
Correct |
4 ms |
4444 KB |
Output is correct |
35 |
Correct |
4 ms |
4444 KB |
Output is correct |
36 |
Correct |
4 ms |
4500 KB |
Output is correct |
37 |
Correct |
4 ms |
4700 KB |
Output is correct |
38 |
Correct |
4 ms |
4708 KB |
Output is correct |
39 |
Correct |
8 ms |
9388 KB |
Output is correct |
40 |
Correct |
6 ms |
6232 KB |
Output is correct |
41 |
Correct |
5 ms |
5156 KB |
Output is correct |
42 |
Correct |
11 ms |
10844 KB |
Output is correct |
43 |
Correct |
6 ms |
6748 KB |
Output is correct |
44 |
Correct |
4 ms |
4440 KB |
Output is correct |
45 |
Correct |
11 ms |
10844 KB |
Output is correct |
46 |
Correct |
8 ms |
7772 KB |
Output is correct |
47 |
Correct |
4 ms |
4444 KB |
Output is correct |
48 |
Correct |
7 ms |
10072 KB |
Output is correct |
49 |
Correct |
8 ms |
10332 KB |
Output is correct |
50 |
Correct |
7 ms |
9256 KB |
Output is correct |
51 |
Correct |
7 ms |
10332 KB |
Output is correct |
52 |
Correct |
7 ms |
9292 KB |
Output is correct |
53 |
Correct |
8 ms |
9380 KB |
Output is correct |
54 |
Correct |
7 ms |
9256 KB |
Output is correct |
55 |
Correct |
8 ms |
9256 KB |
Output is correct |
56 |
Correct |
7 ms |
10036 KB |
Output is correct |
57 |
Correct |
66 ms |
10544 KB |
Output is correct |
58 |
Correct |
7 ms |
10036 KB |
Output is correct |