#include <bits/stdc++.h>
#define ordered_set tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nemeshay ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define allr(pon) pon.rbegin(), pon.rend()
#include <ext/pb_ds/assoc_container.hpp>
#define all(pon) pon.begin(), pon.end()
#include <ext/pb_ds/tree_policy.hpp>
#define pii pair <int, int>
#define nosolve puts("-1")
#define YES puts("YES")
#define pb push_back
#define pf push_front
#define int long long
#define OK puts("OK")
#define NO puts("NO")
#define sigma signed
#define sc second
#define fr first
using namespace __gnu_pbds;
using namespace std;
const int N = 1048576, INF = 2e9 + 7;
int a[N], b[N], dp[N];
vector <int> pon[30];
sigma main(){
nemeshay
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
for (int i = 0; i < n; i++){
for (int l = 0; l < (1 << m); l++){
int sum = 0;
for (int j = 0; j < m; j++){
if (l & (1 << j)) sum += b[j];
}
if (sum == a[i]) pon[i].pb(l);
}
}
for (int i = 1; i < N; i++) dp[i] = -1;
for (int i = 0; i < n; i++){
for (int l = (1 << m) - 1; l >= 0; l--){
if (dp[l] != -1){
for (auto j: pon[i]){
if (!(l & j)){
dp[l | j] = dp[l] + 1;
}
if (dp[l | j] >= n){
YES;
return 0;
}
}
}
}
}
NO;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
10840 KB |
Output is correct |
2 |
Correct |
3 ms |
10844 KB |
Output is correct |
3 |
Correct |
2 ms |
10844 KB |
Output is correct |
4 |
Correct |
4 ms |
10844 KB |
Output is correct |
5 |
Correct |
67 ms |
10836 KB |
Output is correct |
6 |
Correct |
2 ms |
10840 KB |
Output is correct |
7 |
Correct |
2 ms |
10844 KB |
Output is correct |
8 |
Correct |
66 ms |
10740 KB |
Output is correct |
9 |
Correct |
67 ms |
10700 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
10844 KB |
Output is correct |
2 |
Correct |
2 ms |
10844 KB |
Output is correct |
3 |
Correct |
2 ms |
10844 KB |
Output is correct |
4 |
Correct |
3 ms |
10844 KB |
Output is correct |
5 |
Correct |
2 ms |
10844 KB |
Output is correct |
6 |
Correct |
2 ms |
10844 KB |
Output is correct |
7 |
Correct |
2 ms |
10844 KB |
Output is correct |
8 |
Correct |
2 ms |
10844 KB |
Output is correct |
9 |
Correct |
2 ms |
10844 KB |
Output is correct |
10 |
Correct |
2 ms |
10844 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
10844 KB |
Output is correct |
2 |
Correct |
4 ms |
10840 KB |
Output is correct |
3 |
Correct |
11 ms |
10844 KB |
Output is correct |
4 |
Correct |
14 ms |
10844 KB |
Output is correct |
5 |
Correct |
13 ms |
10844 KB |
Output is correct |
6 |
Correct |
6 ms |
10844 KB |
Output is correct |
7 |
Correct |
5 ms |
10844 KB |
Output is correct |
8 |
Correct |
4 ms |
10840 KB |
Output is correct |
9 |
Correct |
9 ms |
10844 KB |
Output is correct |
10 |
Correct |
9 ms |
10708 KB |
Output is correct |
11 |
Correct |
15 ms |
10704 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
10840 KB |
Output is correct |
2 |
Correct |
3 ms |
10844 KB |
Output is correct |
3 |
Correct |
2 ms |
10844 KB |
Output is correct |
4 |
Correct |
4 ms |
10844 KB |
Output is correct |
5 |
Correct |
67 ms |
10836 KB |
Output is correct |
6 |
Correct |
2 ms |
10840 KB |
Output is correct |
7 |
Correct |
2 ms |
10844 KB |
Output is correct |
8 |
Correct |
66 ms |
10740 KB |
Output is correct |
9 |
Correct |
67 ms |
10700 KB |
Output is correct |
10 |
Correct |
2 ms |
10844 KB |
Output is correct |
11 |
Correct |
2 ms |
10844 KB |
Output is correct |
12 |
Correct |
2 ms |
10844 KB |
Output is correct |
13 |
Correct |
3 ms |
10844 KB |
Output is correct |
14 |
Correct |
2 ms |
10844 KB |
Output is correct |
15 |
Correct |
2 ms |
10844 KB |
Output is correct |
16 |
Correct |
2 ms |
10844 KB |
Output is correct |
17 |
Correct |
2 ms |
10844 KB |
Output is correct |
18 |
Correct |
2 ms |
10844 KB |
Output is correct |
19 |
Correct |
2 ms |
10844 KB |
Output is correct |
20 |
Correct |
8 ms |
10844 KB |
Output is correct |
21 |
Correct |
4 ms |
10840 KB |
Output is correct |
22 |
Correct |
11 ms |
10844 KB |
Output is correct |
23 |
Correct |
14 ms |
10844 KB |
Output is correct |
24 |
Correct |
13 ms |
10844 KB |
Output is correct |
25 |
Correct |
6 ms |
10844 KB |
Output is correct |
26 |
Correct |
5 ms |
10844 KB |
Output is correct |
27 |
Correct |
4 ms |
10840 KB |
Output is correct |
28 |
Correct |
9 ms |
10844 KB |
Output is correct |
29 |
Correct |
9 ms |
10708 KB |
Output is correct |
30 |
Correct |
15 ms |
10704 KB |
Output is correct |
31 |
Correct |
132 ms |
10712 KB |
Output is correct |
32 |
Correct |
241 ms |
11148 KB |
Output is correct |
33 |
Correct |
461 ms |
10836 KB |
Output is correct |
34 |
Correct |
670 ms |
10680 KB |
Output is correct |
35 |
Correct |
723 ms |
10696 KB |
Output is correct |
36 |
Execution timed out |
1049 ms |
4444 KB |
Time limit exceeded |
37 |
Halted |
0 ms |
0 KB |
- |