# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
679278 |
2023-01-08T01:40:08 Z |
Hacv16 |
Bank (IZhO14_bank) |
C++17 |
|
1000 ms |
7800 KB |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
const int MAX = 22;
const int MAXM = 50005;
const int INF = 0x3f3f3f3f;
int n, m, a[MAX], b[MAX], sums[1 << MAX];
bool dp[MAX][1 << MAX];
vector<int> g[MAXM];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 0; i < m; i++) cin >> b[i];
for(int mask = 0; mask < (1 << m); mask++){
int cur = 0;
for(int i = 0; i < m; i++)
if(mask & (1 << i)) cur += b[i];
g[cur].emplace_back(mask);
}
dp[0][0] = true;
for(int i = 1; i <= n; i++){
for(int mask = 0; mask < (1 << m); mask++){
for(auto sub : g[a[i]]){
if((mask & sub) != sub) continue;
dp[i][mask] |= (dp[i - 1][mask ^ sub]);
}
}
}
bool pos = false;
for(int mask = 0; mask < (1 << m); mask++)
pos |= dp[n][mask];
cout << (pos ? "YES" : "NO") << '\n';
exit(0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1492 KB |
Output is correct |
2 |
Correct |
1 ms |
1492 KB |
Output is correct |
3 |
Correct |
1 ms |
1492 KB |
Output is correct |
4 |
Correct |
6 ms |
1748 KB |
Output is correct |
5 |
Correct |
32 ms |
7800 KB |
Output is correct |
6 |
Correct |
1 ms |
1492 KB |
Output is correct |
7 |
Correct |
1 ms |
1492 KB |
Output is correct |
8 |
Execution timed out |
1096 ms |
7200 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1492 KB |
Output is correct |
2 |
Correct |
1 ms |
1492 KB |
Output is correct |
3 |
Correct |
1 ms |
1492 KB |
Output is correct |
4 |
Correct |
1 ms |
1492 KB |
Output is correct |
5 |
Correct |
1 ms |
1492 KB |
Output is correct |
6 |
Correct |
1 ms |
1492 KB |
Output is correct |
7 |
Correct |
1 ms |
1492 KB |
Output is correct |
8 |
Correct |
1 ms |
1492 KB |
Output is correct |
9 |
Correct |
1 ms |
1492 KB |
Output is correct |
10 |
Correct |
1 ms |
1492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1748 KB |
Output is correct |
2 |
Correct |
2 ms |
1620 KB |
Output is correct |
3 |
Correct |
2 ms |
1876 KB |
Output is correct |
4 |
Correct |
3 ms |
1876 KB |
Output is correct |
5 |
Correct |
3 ms |
1748 KB |
Output is correct |
6 |
Correct |
2 ms |
1620 KB |
Output is correct |
7 |
Correct |
2 ms |
1748 KB |
Output is correct |
8 |
Correct |
2 ms |
1620 KB |
Output is correct |
9 |
Correct |
2 ms |
1748 KB |
Output is correct |
10 |
Correct |
2 ms |
1748 KB |
Output is correct |
11 |
Correct |
1 ms |
1492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1492 KB |
Output is correct |
2 |
Correct |
1 ms |
1492 KB |
Output is correct |
3 |
Correct |
1 ms |
1492 KB |
Output is correct |
4 |
Correct |
6 ms |
1748 KB |
Output is correct |
5 |
Correct |
32 ms |
7800 KB |
Output is correct |
6 |
Correct |
1 ms |
1492 KB |
Output is correct |
7 |
Correct |
1 ms |
1492 KB |
Output is correct |
8 |
Execution timed out |
1096 ms |
7200 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |