#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
int main()
{
int n,m;
cin>>n>>m;
int a[n],b[m];
for (int i = 0; i < n; i++)cin>>a[i];
for (int i = 0; i < m; i++)cin>>b[i];
vector<pair<int,int>> dp((1<<m),{0,-1});// keeping 'a' fixed stores the index till which the first part of the permutaion can be used and what more is needed to pay a[index+1]
dp[0].second=a[0];
bool check=false;
pair<int,int> p;
for (int i = 1; i < (1<<m); i++)
{
for (int j = 0; j < m; j++)
{
if(i&(1<<j)){
p=dp[i^(1<<j)];
// cout<<i<<j<<endl;
if(p.second<b[j])continue;
p.second-=b[j];
// cout<<i<<" "<<j<<p.first<<" "<<p.second<<endl;
if(p.second==0){
p.first++;
if(p.first==n){
check=true;
dp[i]=p;
break;
}
p.second=a[p.first];
}
if(p.first>=dp[i].first){
dp[i]=p;
}
}
}
}
if(check){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
300 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
63 ms |
8504 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
63 ms |
8500 KB |
Output is correct |
9 |
Correct |
57 ms |
8500 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 |
212 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 |
296 KB |
Output is correct |
8 |
Correct |
1 ms |
288 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
2 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
424 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
444 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
2 ms |
428 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 |
300 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
63 ms |
8504 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
63 ms |
8500 KB |
Output is correct |
9 |
Correct |
57 ms |
8500 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 |
212 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 |
296 KB |
Output is correct |
17 |
Correct |
1 ms |
288 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
2 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
424 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
2 ms |
444 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
1 ms |
340 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
2 ms |
428 KB |
Output is correct |
31 |
Correct |
81 ms |
8500 KB |
Output is correct |
32 |
Correct |
85 ms |
8516 KB |
Output is correct |
33 |
Correct |
62 ms |
8532 KB |
Output is correct |
34 |
Correct |
58 ms |
8488 KB |
Output is correct |
35 |
Correct |
61 ms |
8404 KB |
Output is correct |
36 |
Correct |
61 ms |
8500 KB |
Output is correct |
37 |
Correct |
60 ms |
8500 KB |
Output is correct |
38 |
Correct |
58 ms |
8404 KB |
Output is correct |
39 |
Correct |
54 ms |
8404 KB |
Output is correct |
40 |
Correct |
60 ms |
8504 KB |
Output is correct |
41 |
Correct |
56 ms |
8488 KB |
Output is correct |
42 |
Correct |
80 ms |
8500 KB |
Output is correct |
43 |
Correct |
59 ms |
8504 KB |
Output is correct |
44 |
Correct |
57 ms |
8404 KB |
Output is correct |
45 |
Correct |
76 ms |
8504 KB |
Output is correct |
46 |
Correct |
69 ms |
8404 KB |
Output is correct |
47 |
Correct |
60 ms |
8404 KB |
Output is correct |
48 |
Correct |
64 ms |
8404 KB |
Output is correct |
49 |
Correct |
56 ms |
8500 KB |
Output is correct |
50 |
Correct |
69 ms |
8504 KB |
Output is correct |
51 |
Correct |
60 ms |
8612 KB |
Output is correct |
52 |
Correct |
61 ms |
8500 KB |
Output is correct |
53 |
Correct |
89 ms |
8404 KB |
Output is correct |
54 |
Correct |
83 ms |
8508 KB |
Output is correct |
55 |
Correct |
71 ms |
8532 KB |
Output is correct |
56 |
Correct |
68 ms |
8404 KB |
Output is correct |
57 |
Correct |
77 ms |
8504 KB |
Output is correct |
58 |
Correct |
74 ms |
8500 KB |
Output is correct |