| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 344641 |
2021-01-06T06:57:04 Z |
maskoff |
Bank (IZhO14_bank) |
C++14 |
|
1000 ms |
16064 KB |
#include <bits/stdc++.h>
#define file ""
#define all(x) x.begin(), x.end()
#define sc second
#define fr first
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll inf = 1e18 + 5;
const ll mod = 1e9 + 7;
const int N = 5e5 + 5;
int dx[] = {+1, 0, -1, 0};
int dy[] = {0, +1, 0, -1};
int n, m;
int a[N], b[N];
void solve2() {
vector<int> all[N];
int dp[n + 5][N];
dp[0][0] = true;
for (int mask = 0; mask < (1 << m); mask++) {
int sum = 0;
for (int i = 0; i < m; i++)
if ((1 << i) & mask) sum += b[i + 1];
for (int i = 1; i <= n; i++)
if (a[i] == sum)
all[i].pb(mask);
}
for (int i = 1; i <= n; i++) {
for (int j : all[i]) {
for (int mask = 0; mask < (1 << m); mask++) {
if (j & mask) continue;
dp[i][mask ^ j] |= dp[i - 1][mask];
}
}
}
for (int mask = 0; mask < (1 << m); mask++) if (dp[n][mask]) cout << "YES", exit(0);
cout << "NO", exit(0);
}
void solve1() {
vector<int> dp(N);
dp[0] = true;
for (int i = 1; i <= m; i++) {
for (int w = 1000; w >= 0; w--) {
dp[w + b[i]] |= dp[w];
}
}
if (dp[a[1]]) cout << "YES", exit(0);
else cout << "NO", exit(0);
}
int main() {
ios_base :: sync_with_stdio(false);
cin.tie(nullptr);
srand(time(nullptr));
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
if (n == 1) {
solve1();
return 0;
}
solve2();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2284 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
12140 KB |
Output is correct |
| 2 |
Correct |
9 ms |
12140 KB |
Output is correct |
| 3 |
Correct |
9 ms |
12140 KB |
Output is correct |
| 4 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 5 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 6 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 7 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 8 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 9 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 10 |
Correct |
7 ms |
12140 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
12524 KB |
Output is correct |
| 2 |
Correct |
9 ms |
12268 KB |
Output is correct |
| 3 |
Correct |
9 ms |
12780 KB |
Output is correct |
| 4 |
Correct |
11 ms |
12908 KB |
Output is correct |
| 5 |
Correct |
10 ms |
12652 KB |
Output is correct |
| 6 |
Correct |
8 ms |
12140 KB |
Output is correct |
| 7 |
Correct |
9 ms |
12396 KB |
Output is correct |
| 8 |
Correct |
9 ms |
12268 KB |
Output is correct |
| 9 |
Correct |
9 ms |
12524 KB |
Output is correct |
| 10 |
Correct |
9 ms |
12524 KB |
Output is correct |
| 11 |
Correct |
8 ms |
12140 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2284 KB |
Output is correct |
| 10 |
Correct |
8 ms |
12140 KB |
Output is correct |
| 11 |
Correct |
9 ms |
12140 KB |
Output is correct |
| 12 |
Correct |
9 ms |
12140 KB |
Output is correct |
| 13 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 14 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 15 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 16 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 17 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 18 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 19 |
Correct |
7 ms |
12140 KB |
Output is correct |
| 20 |
Correct |
9 ms |
12524 KB |
Output is correct |
| 21 |
Correct |
9 ms |
12268 KB |
Output is correct |
| 22 |
Correct |
9 ms |
12780 KB |
Output is correct |
| 23 |
Correct |
11 ms |
12908 KB |
Output is correct |
| 24 |
Correct |
10 ms |
12652 KB |
Output is correct |
| 25 |
Correct |
8 ms |
12140 KB |
Output is correct |
| 26 |
Correct |
9 ms |
12396 KB |
Output is correct |
| 27 |
Correct |
9 ms |
12268 KB |
Output is correct |
| 28 |
Correct |
9 ms |
12524 KB |
Output is correct |
| 29 |
Correct |
9 ms |
12524 KB |
Output is correct |
| 30 |
Correct |
8 ms |
12140 KB |
Output is correct |
| 31 |
Execution timed out |
1089 ms |
16064 KB |
Time limit exceeded |
| 32 |
Halted |
0 ms |
0 KB |
- |
