#include <bits/stdc++.h>
#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair
using namespace std;
typedef long long ll;
const ll inf = (ll)1e18 + 7;
const ll N = (ll)1e6 + 7;
int n,m;
int a[21],b[21];
int dp[21][1 << 20];
int t[1 << 20],sum1;
vector <int> vec[21],vec1,vec2;
int p[N];
int us[N],us1[N];
int main () {
cin >> n >> m;
for (int i = 1; i <= n; i ++) {
cin >> a[i];
us1[a[i]] ++;
}
for (int i = 0; i < m; i ++) {
cin >> b[i];
us[b[i]] ++;
}
for (int i = 1; i <= n; i ++) {
if (us[a[i]] > 0 && us1[a[i]] > 0)
us[a[i]] --,us1[a[i]] --;
else
vec2.pb(a[i]);
}
for (int i = 0; i < m; i ++) {
for (int j = 1; j <= us[b[i]]; j ++) {
sum1 += b[i];
vec1.pb(b[i]);
}
us[b[i]] = 0;
}
n = vec2.size();
m = vec1.size();
for (int i = 1; i <= n; i ++)
a[i] = vec2[i - 1];
for (int i = 0; i < m; i ++)
b[i] = vec1[i];
for (int i = 1; i <= n; i ++)
p[i] = p[i - 1] + a[i];
for (int i = 0; i < (1 << m); i ++) {
int sum = 0;
for (int j = 0; j < m; j ++)
if (i & (1 << j))
sum += b[j];
t[i] = sum;
}
dp[1][0] = 1;
vec[1].pb(0);
if (p[n] > sum1) {
cout << "NO";
return 0;
}
for (int i = 1; i <= n; i ++) {
for (int j = 0; j < (1 << m); j ++) {
if (t[j] == a[i]) {
if (n == 1) {
cout << "YES";
return 0;
}
for (int k = 0; k < vec[i].size(); k ++) {
if (!(vec[i][k] & j)) {
int q = sum1 - t[(vec[i][k] | j)];
if (q >= p[n] - p[i] && (m - __builtin_popcount(vec[i][k] | j)) >= n - i) {
vec[i + 1].pb(vec[i][k] | j);
dp[i + 1][vec[i][k] | j] = 1;
}
}
}
}
}
}
if (n == 1) {
cout << "NO" << endl;
return 0;
}
for (int i = 0; i < (1 << m); i ++) {
if (dp[n + 1][i] == 1) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
Compilation message
bank.cpp: In function 'int main()':
bank.cpp:84:51: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int k = 0; k < vec[i].size(); k ++) {
~~^~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
508 KB |
Output is correct |
3 |
Correct |
2 ms |
508 KB |
Output is correct |
4 |
Correct |
3 ms |
604 KB |
Output is correct |
5 |
Correct |
68 ms |
4588 KB |
Output is correct |
6 |
Correct |
2 ms |
4588 KB |
Output is correct |
7 |
Correct |
2 ms |
4588 KB |
Output is correct |
8 |
Correct |
68 ms |
4684 KB |
Output is correct |
9 |
Correct |
70 ms |
4772 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4772 KB |
Output is correct |
2 |
Correct |
2 ms |
4772 KB |
Output is correct |
3 |
Correct |
2 ms |
4772 KB |
Output is correct |
4 |
Correct |
2 ms |
4772 KB |
Output is correct |
5 |
Correct |
2 ms |
4772 KB |
Output is correct |
6 |
Correct |
2 ms |
4772 KB |
Output is correct |
7 |
Correct |
2 ms |
4772 KB |
Output is correct |
8 |
Correct |
2 ms |
4772 KB |
Output is correct |
9 |
Correct |
2 ms |
4772 KB |
Output is correct |
10 |
Correct |
2 ms |
4772 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4772 KB |
Output is correct |
2 |
Correct |
3 ms |
4772 KB |
Output is correct |
3 |
Correct |
2 ms |
4772 KB |
Output is correct |
4 |
Correct |
2 ms |
4772 KB |
Output is correct |
5 |
Correct |
2 ms |
4772 KB |
Output is correct |
6 |
Correct |
3 ms |
4772 KB |
Output is correct |
7 |
Correct |
3 ms |
4772 KB |
Output is correct |
8 |
Correct |
3 ms |
4772 KB |
Output is correct |
9 |
Correct |
2 ms |
4772 KB |
Output is correct |
10 |
Correct |
2 ms |
4772 KB |
Output is correct |
11 |
Correct |
3 ms |
4772 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
508 KB |
Output is correct |
3 |
Correct |
2 ms |
508 KB |
Output is correct |
4 |
Correct |
3 ms |
604 KB |
Output is correct |
5 |
Correct |
68 ms |
4588 KB |
Output is correct |
6 |
Correct |
2 ms |
4588 KB |
Output is correct |
7 |
Correct |
2 ms |
4588 KB |
Output is correct |
8 |
Correct |
68 ms |
4684 KB |
Output is correct |
9 |
Correct |
70 ms |
4772 KB |
Output is correct |
10 |
Correct |
2 ms |
4772 KB |
Output is correct |
11 |
Correct |
2 ms |
4772 KB |
Output is correct |
12 |
Correct |
2 ms |
4772 KB |
Output is correct |
13 |
Correct |
2 ms |
4772 KB |
Output is correct |
14 |
Correct |
2 ms |
4772 KB |
Output is correct |
15 |
Correct |
2 ms |
4772 KB |
Output is correct |
16 |
Correct |
2 ms |
4772 KB |
Output is correct |
17 |
Correct |
2 ms |
4772 KB |
Output is correct |
18 |
Correct |
2 ms |
4772 KB |
Output is correct |
19 |
Correct |
2 ms |
4772 KB |
Output is correct |
20 |
Correct |
3 ms |
4772 KB |
Output is correct |
21 |
Correct |
3 ms |
4772 KB |
Output is correct |
22 |
Correct |
2 ms |
4772 KB |
Output is correct |
23 |
Correct |
2 ms |
4772 KB |
Output is correct |
24 |
Correct |
2 ms |
4772 KB |
Output is correct |
25 |
Correct |
3 ms |
4772 KB |
Output is correct |
26 |
Correct |
3 ms |
4772 KB |
Output is correct |
27 |
Correct |
3 ms |
4772 KB |
Output is correct |
28 |
Correct |
2 ms |
4772 KB |
Output is correct |
29 |
Correct |
2 ms |
4772 KB |
Output is correct |
30 |
Correct |
3 ms |
4772 KB |
Output is correct |
31 |
Correct |
76 ms |
6936 KB |
Output is correct |
32 |
Execution timed out |
1073 ms |
10788 KB |
Time limit exceeded |
33 |
Halted |
0 ms |
0 KB |
- |