#include <bits/stdc++.h>
using namespace std;
int a[23],b[23],n,m;
void dfs(int x,int sum,int state,int k,int num)
{
int i;
if(x>n)
{
cout << "YES";
exit(0);
}
if(sum==0)
{
dfs(x+1,a[x+1],state,0,num);
return;
}
for(i=k;i<m;i++)
{
if(m-num-1<n-x) break;
if((state>>i)&1 || sum<b[i]) continue;
dfs(x,sum-b[i],state|(1<<i),i+1,num+1);
}
}
int main()
{
int i;
cin >> n >> m;
for(i=1;i<=n;i++) cin >> a[i];
for(i=1;i<=m;i++) cin >> b[i];
dfs(1,a[1],0,1,0);
cout << "NO";
return 0;
}
# |
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 |
536 KB |
Output is correct |
4 |
Correct |
2 ms |
536 KB |
Output is correct |
5 |
Correct |
2 ms |
536 KB |
Output is correct |
6 |
Correct |
2 ms |
536 KB |
Output is correct |
7 |
Correct |
2 ms |
536 KB |
Output is correct |
8 |
Correct |
2 ms |
536 KB |
Output is correct |
9 |
Correct |
5 ms |
536 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
540 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
540 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
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 |
536 KB |
Output is correct |
4 |
Correct |
2 ms |
536 KB |
Output is correct |
5 |
Correct |
2 ms |
536 KB |
Output is correct |
6 |
Correct |
2 ms |
536 KB |
Output is correct |
7 |
Correct |
2 ms |
536 KB |
Output is correct |
8 |
Correct |
2 ms |
536 KB |
Output is correct |
9 |
Correct |
5 ms |
536 KB |
Output is correct |
10 |
Incorrect |
2 ms |
540 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |