#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int> sal(n);
vector<int> bank(m);
for(int i=0;i<n;i++)cin>>sal[i];
for(int i=0;i<m;i++)cin>>bank[i];
vector<int> extra(1<<m,-1);
vector<int> paid(1<<m,-1);
extra[0]=paid[0]=0;
for(int j=0;j<(1<<m);j++){
for(int k=0;k<m;k++){
if(j&(1<<k))continue;
if(extra[j]+bank[k]<sal[paid[j]]&&paid[j]>paid[j+(1<<k)]){
extra[j+(1<<k)]=extra[j]+bank[k];
paid[j+(1<<k)]=paid[j];
}
else if(extra[j]+bank[k]==sal[paid[j]]&&paid[j]+1>paid[j+(1<<k)]){
extra[j+(1<<k)]=0;
paid[j+(1<<k)]=paid[j]+1;
if(paid[j+(1<<k)]==n){
cout<<"YES";
return 0;
}
}
}
}
cout<<"NO";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
460 KB |
Output is correct |
5 |
Correct |
74 ms |
8492 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
5 ms |
8396 KB |
Output is correct |
9 |
Correct |
80 ms |
8396 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
288 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
332 KB |
Output is correct |
5 |
Correct |
2 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
2 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
460 KB |
Output is correct |
5 |
Correct |
74 ms |
8492 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
5 ms |
8396 KB |
Output is correct |
9 |
Correct |
80 ms |
8396 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
288 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
2 ms |
332 KB |
Output is correct |
21 |
Correct |
1 ms |
332 KB |
Output is correct |
22 |
Correct |
1 ms |
332 KB |
Output is correct |
23 |
Correct |
2 ms |
332 KB |
Output is correct |
24 |
Correct |
2 ms |
332 KB |
Output is correct |
25 |
Correct |
1 ms |
332 KB |
Output is correct |
26 |
Correct |
1 ms |
332 KB |
Output is correct |
27 |
Correct |
1 ms |
332 KB |
Output is correct |
28 |
Correct |
1 ms |
332 KB |
Output is correct |
29 |
Correct |
1 ms |
332 KB |
Output is correct |
30 |
Correct |
2 ms |
332 KB |
Output is correct |
31 |
Correct |
50 ms |
8500 KB |
Output is correct |
32 |
Correct |
56 ms |
8500 KB |
Output is correct |
33 |
Correct |
48 ms |
8500 KB |
Output is correct |
34 |
Correct |
40 ms |
8508 KB |
Output is correct |
35 |
Correct |
72 ms |
8396 KB |
Output is correct |
36 |
Correct |
75 ms |
8500 KB |
Output is correct |
37 |
Correct |
100 ms |
8496 KB |
Output is correct |
38 |
Correct |
76 ms |
8388 KB |
Output is correct |
39 |
Correct |
5 ms |
8396 KB |
Output is correct |
40 |
Correct |
75 ms |
8500 KB |
Output is correct |
41 |
Correct |
75 ms |
8396 KB |
Output is correct |
42 |
Correct |
99 ms |
8396 KB |
Output is correct |
43 |
Correct |
76 ms |
8396 KB |
Output is correct |
44 |
Correct |
80 ms |
8516 KB |
Output is correct |
45 |
Correct |
5 ms |
8396 KB |
Output is correct |
46 |
Correct |
46 ms |
8496 KB |
Output is correct |
47 |
Correct |
79 ms |
8396 KB |
Output is correct |
48 |
Correct |
5 ms |
8524 KB |
Output is correct |
49 |
Correct |
73 ms |
8496 KB |
Output is correct |
50 |
Correct |
51 ms |
8500 KB |
Output is correct |
51 |
Correct |
58 ms |
8396 KB |
Output is correct |
52 |
Correct |
52 ms |
8516 KB |
Output is correct |
53 |
Correct |
59 ms |
8396 KB |
Output is correct |
54 |
Correct |
53 ms |
8396 KB |
Output is correct |
55 |
Correct |
51 ms |
8500 KB |
Output is correct |
56 |
Correct |
49 ms |
8396 KB |
Output is correct |
57 |
Correct |
87 ms |
8500 KB |
Output is correct |
58 |
Correct |
49 ms |
8396 KB |
Output is correct |