#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for (ll i = (x); i < (y); i++)
using namespace std;
set<ll> dp[21];
map<ll, vector<ll>> idk;
//cd "/home/s/saco06/Desktop/" && g++ bank.cpp -o bank && "/home/s/saco06/Desktop/"bank
int main(){
ll n,m;
cin >> n >> m;
vector<ll> lis1(n);
vector<ll> lis2(m);
FOR(i,0,n){
cin >> lis1[i];
}
FOR(i,0,m){
cin >> lis2[i];
}
for (auto&i : lis1){
idk[i] = {};
}
FOR(i, 0, (1<<m)){
ll sum = 0;
FOR(j,0,m){
if (i & (1<<j)){
sum += lis2[j];
}
}
if (idk.count(sum)){
idk[sum].push_back(i);
}
}
for (auto&i : idk[lis1[0]]){
dp[0].insert(i);
}
FOR(i, 0, n-1){
for (auto&j : dp[i]){
for (auto&k : idk[lis1[i+1]]){
if (j&k) continue;
dp[i+1].insert(j|k);
}
}
}
if (dp[n-1].size()){
cout << "YES";
}else{
cout << "NO";
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
300 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
3 ms |
212 KB |
Output is correct |
| 5 |
Correct |
61 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
304 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
77 ms |
600 KB |
Output is correct |
| 9 |
Correct |
60 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
296 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
296 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
292 KB |
Output is correct |
| 2 |
Correct |
2 ms |
212 KB |
Output is correct |
| 3 |
Correct |
2 ms |
212 KB |
Output is correct |
| 4 |
Correct |
2 ms |
212 KB |
Output is correct |
| 5 |
Correct |
2 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
2 ms |
212 KB |
Output is correct |
| 8 |
Correct |
2 ms |
296 KB |
Output is correct |
| 9 |
Correct |
2 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
2 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
300 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
3 ms |
212 KB |
Output is correct |
| 5 |
Correct |
61 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
304 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
77 ms |
600 KB |
Output is correct |
| 9 |
Correct |
60 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
296 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
296 KB |
Output is correct |
| 20 |
Correct |
2 ms |
292 KB |
Output is correct |
| 21 |
Correct |
2 ms |
212 KB |
Output is correct |
| 22 |
Correct |
2 ms |
212 KB |
Output is correct |
| 23 |
Correct |
2 ms |
212 KB |
Output is correct |
| 24 |
Correct |
2 ms |
212 KB |
Output is correct |
| 25 |
Correct |
1 ms |
212 KB |
Output is correct |
| 26 |
Correct |
2 ms |
212 KB |
Output is correct |
| 27 |
Correct |
2 ms |
296 KB |
Output is correct |
| 28 |
Correct |
2 ms |
212 KB |
Output is correct |
| 29 |
Correct |
1 ms |
212 KB |
Output is correct |
| 30 |
Correct |
2 ms |
212 KB |
Output is correct |
| 31 |
Correct |
62 ms |
308 KB |
Output is correct |
| 32 |
Correct |
151 ms |
1128 KB |
Output is correct |
| 33 |
Correct |
64 ms |
280 KB |
Output is correct |
| 34 |
Correct |
70 ms |
212 KB |
Output is correct |
| 35 |
Correct |
70 ms |
284 KB |
Output is correct |
| 36 |
Correct |
66 ms |
288 KB |
Output is correct |
| 37 |
Correct |
66 ms |
276 KB |
Output is correct |
| 38 |
Correct |
67 ms |
284 KB |
Output is correct |
| 39 |
Correct |
264 ms |
12668 KB |
Output is correct |
| 40 |
Correct |
68 ms |
212 KB |
Output is correct |
| 41 |
Correct |
66 ms |
280 KB |
Output is correct |
| 42 |
Correct |
77 ms |
592 KB |
Output is correct |
| 43 |
Correct |
73 ms |
304 KB |
Output is correct |
| 44 |
Correct |
71 ms |
276 KB |
Output is correct |
| 45 |
Correct |
71 ms |
432 KB |
Output is correct |
| 46 |
Correct |
70 ms |
428 KB |
Output is correct |
| 47 |
Correct |
66 ms |
212 KB |
Output is correct |
| 48 |
Correct |
65 ms |
472 KB |
Output is correct |
| 49 |
Correct |
64 ms |
212 KB |
Output is correct |
| 50 |
Execution timed out |
1002 ms |
44644 KB |
Time limit exceeded |
| 51 |
Halted |
0 ms |
0 KB |
- |
