# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
88432 |
2018-12-05T21:35:42 Z |
xiaowuc1 |
Bank (IZhO14_bank) |
C++14 |
|
1000 ms |
16692 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m;
int val[20];
int bases[20];
vector<int> masks[1001];
void solve() {
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> val[i];
sort(val, val+n);
reverse(val, val+n);
for(int i = 0; i < m; i++) cin >> bases[i];
for(int mask = 1; mask < (1<<m); mask++) {
int v = 0;
int t = mask;
while(v <= 1000 && t) {
v += bases[__builtin_ctz(t)];
t &= t-1;
}
if(v <= 1000) masks[v].push_back(mask);
}
set<int> ret;
ret.insert(0);
for(int i = 0; i < n; i++) {
set<int> nret;
for(int out2: ret) {
for(int out: masks[val[i]]) {
if(out&out2) continue;
if(__builtin_popcount(out | out2) + (n-i-1) > m) continue;
nret.insert(out | out2);
}
}
ret = nret;
}
if(ret.empty()) cout << "NO\n";
else cout << "YES\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
508 KB |
Output is correct |
3 |
Correct |
2 ms |
508 KB |
Output is correct |
4 |
Correct |
3 ms |
592 KB |
Output is correct |
5 |
Correct |
27 ms |
6608 KB |
Output is correct |
6 |
Correct |
2 ms |
6608 KB |
Output is correct |
7 |
Correct |
2 ms |
6608 KB |
Output is correct |
8 |
Correct |
27 ms |
6608 KB |
Output is correct |
9 |
Correct |
28 ms |
6608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
6608 KB |
Output is correct |
2 |
Correct |
2 ms |
6608 KB |
Output is correct |
3 |
Correct |
2 ms |
6608 KB |
Output is correct |
4 |
Correct |
2 ms |
6608 KB |
Output is correct |
5 |
Correct |
2 ms |
6608 KB |
Output is correct |
6 |
Correct |
2 ms |
6608 KB |
Output is correct |
7 |
Correct |
2 ms |
6608 KB |
Output is correct |
8 |
Correct |
2 ms |
6608 KB |
Output is correct |
9 |
Correct |
2 ms |
6608 KB |
Output is correct |
10 |
Correct |
2 ms |
6608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
6608 KB |
Output is correct |
2 |
Correct |
2 ms |
6608 KB |
Output is correct |
3 |
Correct |
2 ms |
6608 KB |
Output is correct |
4 |
Correct |
2 ms |
6608 KB |
Output is correct |
5 |
Correct |
2 ms |
6608 KB |
Output is correct |
6 |
Correct |
2 ms |
6608 KB |
Output is correct |
7 |
Correct |
2 ms |
6608 KB |
Output is correct |
8 |
Correct |
2 ms |
6608 KB |
Output is correct |
9 |
Correct |
2 ms |
6608 KB |
Output is correct |
10 |
Correct |
2 ms |
6608 KB |
Output is correct |
11 |
Correct |
2 ms |
6608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
508 KB |
Output is correct |
3 |
Correct |
2 ms |
508 KB |
Output is correct |
4 |
Correct |
3 ms |
592 KB |
Output is correct |
5 |
Correct |
27 ms |
6608 KB |
Output is correct |
6 |
Correct |
2 ms |
6608 KB |
Output is correct |
7 |
Correct |
2 ms |
6608 KB |
Output is correct |
8 |
Correct |
27 ms |
6608 KB |
Output is correct |
9 |
Correct |
28 ms |
6608 KB |
Output is correct |
10 |
Correct |
2 ms |
6608 KB |
Output is correct |
11 |
Correct |
2 ms |
6608 KB |
Output is correct |
12 |
Correct |
2 ms |
6608 KB |
Output is correct |
13 |
Correct |
2 ms |
6608 KB |
Output is correct |
14 |
Correct |
2 ms |
6608 KB |
Output is correct |
15 |
Correct |
2 ms |
6608 KB |
Output is correct |
16 |
Correct |
2 ms |
6608 KB |
Output is correct |
17 |
Correct |
2 ms |
6608 KB |
Output is correct |
18 |
Correct |
2 ms |
6608 KB |
Output is correct |
19 |
Correct |
2 ms |
6608 KB |
Output is correct |
20 |
Correct |
2 ms |
6608 KB |
Output is correct |
21 |
Correct |
2 ms |
6608 KB |
Output is correct |
22 |
Correct |
2 ms |
6608 KB |
Output is correct |
23 |
Correct |
2 ms |
6608 KB |
Output is correct |
24 |
Correct |
2 ms |
6608 KB |
Output is correct |
25 |
Correct |
2 ms |
6608 KB |
Output is correct |
26 |
Correct |
2 ms |
6608 KB |
Output is correct |
27 |
Correct |
2 ms |
6608 KB |
Output is correct |
28 |
Correct |
2 ms |
6608 KB |
Output is correct |
29 |
Correct |
2 ms |
6608 KB |
Output is correct |
30 |
Correct |
2 ms |
6608 KB |
Output is correct |
31 |
Correct |
28 ms |
6608 KB |
Output is correct |
32 |
Correct |
115 ms |
6608 KB |
Output is correct |
33 |
Correct |
16 ms |
6608 KB |
Output is correct |
34 |
Correct |
7 ms |
6608 KB |
Output is correct |
35 |
Correct |
7 ms |
6608 KB |
Output is correct |
36 |
Correct |
7 ms |
6608 KB |
Output is correct |
37 |
Correct |
11 ms |
6608 KB |
Output is correct |
38 |
Correct |
13 ms |
6608 KB |
Output is correct |
39 |
Correct |
282 ms |
16692 KB |
Output is correct |
40 |
Correct |
20 ms |
16692 KB |
Output is correct |
41 |
Correct |
17 ms |
16692 KB |
Output is correct |
42 |
Correct |
34 ms |
16692 KB |
Output is correct |
43 |
Correct |
21 ms |
16692 KB |
Output is correct |
44 |
Correct |
6 ms |
16692 KB |
Output is correct |
45 |
Correct |
28 ms |
16692 KB |
Output is correct |
46 |
Correct |
24 ms |
16692 KB |
Output is correct |
47 |
Correct |
7 ms |
16692 KB |
Output is correct |
48 |
Correct |
26 ms |
16692 KB |
Output is correct |
49 |
Correct |
25 ms |
16692 KB |
Output is correct |
50 |
Correct |
45 ms |
16692 KB |
Output is correct |
51 |
Correct |
51 ms |
16692 KB |
Output is correct |
52 |
Correct |
656 ms |
16692 KB |
Output is correct |
53 |
Execution timed out |
1073 ms |
16692 KB |
Time limit exceeded |
54 |
Halted |
0 ms |
0 KB |
- |