#include <bits/stdc++.h>
using namespace std;
int sal[22];
int val[22];
vector<int> maski[1002];
int n,m,koniec=0;
bool backtrack(int maska, int pos){
if (pos==n)return true;
koniec++;
for (auto u : maski[sal[pos]]){
if (!(u&maska) && backtrack(u^maska,pos+1))return true;
if (koniec>1000000)return false;
}
return false;
}
bool sorting(int a, int b){
return maski[a].size()<maski[b].size();
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int v;
cin >> n >> m;
multiset<int> wart,bank;
for (int i = 0; i<n; i++){
cin >> v;
wart.insert(v);
}
for (int i = 0; i<m; i++){
cin >> v;
auto it=wart.find(v);
if (it!=wart.end())wart.erase(it);
else bank.insert(v);
}
n=wart.size();
m=bank.size();
if (n>10){
cout << "NO\n";
return 0;
}
int iter=0,sm;
for (auto u : wart)sal[iter++]=u;
iter=0;
for (auto u : bank)val[iter++]=u;
for (int i = 1; i<(1<<m); i++){
sm=0;
for (int j = 0; j<m; j++){
if (i&(1<<j))sm+=val[j];
}
if (sm<=1000)maski[sm].push_back(i);
}
sort(sal,sal+n,sorting);
if (backtrack(0,0))cout << "YES\n";
else cout << "NO\n";
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
2 ms |
604 KB |
Output is correct |
| 5 |
Correct |
72 ms |
6444 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
72 ms |
5564 KB |
Output is correct |
| 9 |
Correct |
72 ms |
5968 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 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 |
600 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
464 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 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 |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
2 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
2 ms |
604 KB |
Output is correct |
| 5 |
Correct |
72 ms |
6444 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
72 ms |
5564 KB |
Output is correct |
| 9 |
Correct |
72 ms |
5968 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 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 |
600 KB |
Output is correct |
| 16 |
Correct |
0 ms |
344 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
464 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
1 ms |
348 KB |
Output is correct |
| 22 |
Correct |
0 ms |
348 KB |
Output is correct |
| 23 |
Correct |
0 ms |
348 KB |
Output is correct |
| 24 |
Correct |
1 ms |
348 KB |
Output is correct |
| 25 |
Correct |
2 ms |
344 KB |
Output is correct |
| 26 |
Correct |
1 ms |
348 KB |
Output is correct |
| 27 |
Correct |
1 ms |
348 KB |
Output is correct |
| 28 |
Correct |
1 ms |
348 KB |
Output is correct |
| 29 |
Correct |
0 ms |
348 KB |
Output is correct |
| 30 |
Correct |
0 ms |
348 KB |
Output is correct |
| 31 |
Correct |
71 ms |
5200 KB |
Output is correct |
| 32 |
Correct |
77 ms |
5460 KB |
Output is correct |
| 33 |
Correct |
68 ms |
1216 KB |
Output is correct |
| 34 |
Correct |
34 ms |
484 KB |
Output is correct |
| 35 |
Correct |
17 ms |
344 KB |
Output is correct |
| 36 |
Correct |
0 ms |
344 KB |
Output is correct |
| 37 |
Correct |
68 ms |
600 KB |
Output is correct |
| 38 |
Correct |
69 ms |
596 KB |
Output is correct |
| 39 |
Correct |
1 ms |
344 KB |
Output is correct |
| 40 |
Correct |
68 ms |
2104 KB |
Output is correct |
| 41 |
Correct |
0 ms |
348 KB |
Output is correct |
| 42 |
Correct |
126 ms |
5512 KB |
Output is correct |
| 43 |
Correct |
69 ms |
2132 KB |
Output is correct |
| 44 |
Correct |
0 ms |
348 KB |
Output is correct |
| 45 |
Correct |
76 ms |
6100 KB |
Output is correct |
| 46 |
Correct |
69 ms |
3408 KB |
Output is correct |
| 47 |
Correct |
0 ms |
348 KB |
Output is correct |
| 48 |
Correct |
72 ms |
5676 KB |
Output is correct |
| 49 |
Correct |
72 ms |
6008 KB |
Output is correct |
| 50 |
Correct |
0 ms |
344 KB |
Output is correct |
| 51 |
Correct |
77 ms |
3340 KB |
Output is correct |
| 52 |
Incorrect |
374 ms |
4852 KB |
Output isn't correct |
| 53 |
Halted |
0 ms |
0 KB |
- |
