# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
392622 | vanic | Bank (IZhO14_bank) | C++14 | 1092 ms | 256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <bitset>
using namespace std;
const int maxn=20;
int n, m;
int a[maxn];
int b[maxn];
bitset < maxn > p;
bool rek(int x, int y, int br){
if(x==n){
return 1;
}
if(br==a[x]){
return rek(x+1, 0, 0);
}
if(y==m || br>a[x]){
return 0;
}
if(p[y]){
return rek(x, y+1, br);
}
br+=b[y];
p[y]=1;
if(rek(x, y+1, br)){
return 1;
}
br-=b[y];
p[y]=0;
if(rek(x, y+1, br)){
return 1;
}
return 0;
}
bool cmp(int a, int b){
return a>b;
}
int main(){
scanf("%d%d", &n, &m);
for(int i=0; i<n; i++){
scanf("%d", a+i);
}
sort(a, a+n);
for(int i=0; i<m; i++){
scanf("%d", b+i);
}
sort(b, b+m, cmp);
if(rek(0, 0, 0)){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |