# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
37783 |
2017-12-28T06:10:51 Z |
Talant |
Bank (IZhO14_bank) |
C++14 |
|
1000 ms |
4740 KB |
#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];
int main () {
cin >> n >> m;
for (int i = 1; i <= n; i ++)
cin >> a[i];
for (int i = 0; i < m; i ++)
cin >> b[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;
for (int i = 1; i <= n; i ++) {
for (int j = 0; j < (1 << m); j ++) {
if (t[j] == a[i]) {
for (int k = 0; k < (1 << m); k ++) {
int o = k;
for (int l = 0; l < m; l ++)
if (j & (1 << l)) {
if (o & (1 << l))
o = (o ^ (1 << l));
else
o = (o & (1 << l));
}
if (dp[i][o] == 1)
dp[i + 1][j] = 1;
}
}
}
}
for (int i = 0; i < (1 << m); i ++) {
if (dp[n + 1][i] == 1) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
472 KB |
Output is correct |
4 |
Correct |
114 ms |
640 KB |
Output is correct |
5 |
Correct |
66 ms |
4596 KB |
Output is correct |
6 |
Correct |
2 ms |
4596 KB |
Output is correct |
7 |
Correct |
3 ms |
4596 KB |
Output is correct |
8 |
Execution timed out |
1078 ms |
4740 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4740 KB |
Output is correct |
2 |
Correct |
2 ms |
4740 KB |
Output is correct |
3 |
Correct |
2 ms |
4740 KB |
Output is correct |
4 |
Correct |
2 ms |
4740 KB |
Output is correct |
5 |
Correct |
2 ms |
4740 KB |
Output is correct |
6 |
Correct |
2 ms |
4740 KB |
Output is correct |
7 |
Correct |
3 ms |
4740 KB |
Output is correct |
8 |
Incorrect |
3 ms |
4740 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
4740 KB |
Output is correct |
2 |
Correct |
14 ms |
4740 KB |
Output is correct |
3 |
Correct |
5 ms |
4740 KB |
Output is correct |
4 |
Correct |
14 ms |
4740 KB |
Output is correct |
5 |
Correct |
13 ms |
4740 KB |
Output is correct |
6 |
Correct |
3 ms |
4740 KB |
Output is correct |
7 |
Correct |
7 ms |
4740 KB |
Output is correct |
8 |
Correct |
9 ms |
4740 KB |
Output is correct |
9 |
Correct |
5 ms |
4740 KB |
Output is correct |
10 |
Correct |
5 ms |
4740 KB |
Output is correct |
11 |
Correct |
3 ms |
4740 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
472 KB |
Output is correct |
4 |
Correct |
114 ms |
640 KB |
Output is correct |
5 |
Correct |
66 ms |
4596 KB |
Output is correct |
6 |
Correct |
2 ms |
4596 KB |
Output is correct |
7 |
Correct |
3 ms |
4596 KB |
Output is correct |
8 |
Execution timed out |
1078 ms |
4740 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |