/*input
2 6
9 10
5 4 8 6 3 11
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;
int raise(int a,int n,int m = MOD){
if(n == 0)return 1;
if(n == 1)return a;
int x = 1;
x *= raise(a,n/2,m);
x %= m;
x *= x;
x %= m;
if(n%2)x*= a;
x %= m;
return x;
}
int floor1(int n,int k){
if(n%k == 0 || n >= 0)return n/k;
return (n/k)-1;
}
int ceil1(int n,int k){
return floor1(n+k-1,k);
}
const int K = 1001;
const int N = 20;
vector<int> store[K];
int n,m;
int a[N],b[N];
int mem[N][1<<N];
int dp(int i,int mask){
if(i == m)return 1;
if(mem[i][mask] != -1)return mem[i][mask];
int res = 0;
for(auto newm:store[a[i]]){
if(newm&mask)continue;
res = max(res,dp(i+1,mask|newm));
}
mem[i][mask] = res;
return res;
}
void solve(){
REP(i,N){
REP(j,1<<N)mem[i][j] = -1;
}
cin >> m >> n;
REP(i,m)cin >> a[i];
REP(i,n)cin >> b[i];
REP(i,1<<n){
int sum = 0;
for(int j = 0;j < n;j++){
if(i&(1<<j))sum += b[j];
}
if(sum > 1000)continue;
store[sum].pb(i);
}
if(dp(0,0))cout << "YES";
else cout << "NO";
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//freopen(".in","r",stdin);freopen(".out","w",stdout);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
129 ms |
164472 KB |
Output is correct |
2 |
Correct |
130 ms |
164524 KB |
Output is correct |
3 |
Correct |
130 ms |
164556 KB |
Output is correct |
4 |
Correct |
134 ms |
164928 KB |
Output is correct |
5 |
Correct |
232 ms |
176304 KB |
Output is correct |
6 |
Correct |
135 ms |
164504 KB |
Output is correct |
7 |
Correct |
133 ms |
164572 KB |
Output is correct |
8 |
Correct |
231 ms |
175096 KB |
Output is correct |
9 |
Correct |
231 ms |
176000 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
130 ms |
164524 KB |
Output is correct |
2 |
Correct |
130 ms |
164472 KB |
Output is correct |
3 |
Correct |
131 ms |
164540 KB |
Output is correct |
4 |
Correct |
152 ms |
164600 KB |
Output is correct |
5 |
Correct |
131 ms |
164472 KB |
Output is correct |
6 |
Correct |
131 ms |
164544 KB |
Output is correct |
7 |
Correct |
131 ms |
164572 KB |
Output is correct |
8 |
Correct |
130 ms |
164540 KB |
Output is correct |
9 |
Correct |
135 ms |
164472 KB |
Output is correct |
10 |
Correct |
136 ms |
164528 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
133 ms |
164544 KB |
Output is correct |
2 |
Correct |
134 ms |
164600 KB |
Output is correct |
3 |
Correct |
138 ms |
164484 KB |
Output is correct |
4 |
Correct |
131 ms |
164728 KB |
Output is correct |
5 |
Correct |
132 ms |
164744 KB |
Output is correct |
6 |
Correct |
134 ms |
164600 KB |
Output is correct |
7 |
Correct |
133 ms |
164728 KB |
Output is correct |
8 |
Correct |
131 ms |
164600 KB |
Output is correct |
9 |
Correct |
135 ms |
164600 KB |
Output is correct |
10 |
Correct |
131 ms |
164600 KB |
Output is correct |
11 |
Correct |
131 ms |
164732 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
129 ms |
164472 KB |
Output is correct |
2 |
Correct |
130 ms |
164524 KB |
Output is correct |
3 |
Correct |
130 ms |
164556 KB |
Output is correct |
4 |
Correct |
134 ms |
164928 KB |
Output is correct |
5 |
Correct |
232 ms |
176304 KB |
Output is correct |
6 |
Correct |
135 ms |
164504 KB |
Output is correct |
7 |
Correct |
133 ms |
164572 KB |
Output is correct |
8 |
Correct |
231 ms |
175096 KB |
Output is correct |
9 |
Correct |
231 ms |
176000 KB |
Output is correct |
10 |
Correct |
130 ms |
164524 KB |
Output is correct |
11 |
Correct |
130 ms |
164472 KB |
Output is correct |
12 |
Correct |
131 ms |
164540 KB |
Output is correct |
13 |
Correct |
152 ms |
164600 KB |
Output is correct |
14 |
Correct |
131 ms |
164472 KB |
Output is correct |
15 |
Correct |
131 ms |
164544 KB |
Output is correct |
16 |
Correct |
131 ms |
164572 KB |
Output is correct |
17 |
Correct |
130 ms |
164540 KB |
Output is correct |
18 |
Correct |
135 ms |
164472 KB |
Output is correct |
19 |
Correct |
136 ms |
164528 KB |
Output is correct |
20 |
Correct |
133 ms |
164544 KB |
Output is correct |
21 |
Correct |
134 ms |
164600 KB |
Output is correct |
22 |
Correct |
138 ms |
164484 KB |
Output is correct |
23 |
Correct |
131 ms |
164728 KB |
Output is correct |
24 |
Correct |
132 ms |
164744 KB |
Output is correct |
25 |
Correct |
134 ms |
164600 KB |
Output is correct |
26 |
Correct |
133 ms |
164728 KB |
Output is correct |
27 |
Correct |
131 ms |
164600 KB |
Output is correct |
28 |
Correct |
135 ms |
164600 KB |
Output is correct |
29 |
Correct |
131 ms |
164600 KB |
Output is correct |
30 |
Correct |
131 ms |
164732 KB |
Output is correct |
31 |
Correct |
232 ms |
174428 KB |
Output is correct |
32 |
Correct |
293 ms |
175804 KB |
Output is correct |
33 |
Correct |
220 ms |
165808 KB |
Output is correct |
34 |
Correct |
213 ms |
164472 KB |
Output is correct |
35 |
Correct |
212 ms |
164472 KB |
Output is correct |
36 |
Correct |
212 ms |
164472 KB |
Output is correct |
37 |
Correct |
213 ms |
164824 KB |
Output is correct |
38 |
Correct |
214 ms |
164780 KB |
Output is correct |
39 |
Correct |
254 ms |
174528 KB |
Output is correct |
40 |
Correct |
219 ms |
167716 KB |
Output is correct |
41 |
Correct |
213 ms |
165448 KB |
Output is correct |
42 |
Correct |
234 ms |
174924 KB |
Output is correct |
43 |
Correct |
217 ms |
167824 KB |
Output is correct |
44 |
Correct |
214 ms |
164472 KB |
Output is correct |
45 |
Correct |
231 ms |
175736 KB |
Output is correct |
46 |
Correct |
221 ms |
170488 KB |
Output is correct |
47 |
Correct |
213 ms |
164584 KB |
Output is correct |
48 |
Correct |
234 ms |
175720 KB |
Output is correct |
49 |
Correct |
238 ms |
175812 KB |
Output is correct |
50 |
Correct |
384 ms |
174344 KB |
Output is correct |
51 |
Correct |
231 ms |
175480 KB |
Output is correct |
52 |
Correct |
237 ms |
173824 KB |
Output is correct |
53 |
Correct |
648 ms |
173852 KB |
Output is correct |
54 |
Correct |
429 ms |
174384 KB |
Output is correct |
55 |
Correct |
399 ms |
174376 KB |
Output is correct |
56 |
Correct |
425 ms |
175524 KB |
Output is correct |
57 |
Correct |
403 ms |
175528 KB |
Output is correct |
58 |
Correct |
401 ms |
175652 KB |
Output is correct |