# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37833 | 2017-12-28T08:40:22 Z | Talant | Bank (IZhO14_bank) | C++14 | 63 ms | 4640 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],sum1; vector <int> vec[21]; int p[N]; int main () { cin >> n >> m; for (int i = 1; i <= n; i ++) { cin >> a[i]; p[i] = p[i - 1] + a[i]; } for (int i = 0; i < m; i ++) { cin >> b[i]; sum1 += 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; 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]) { vec[i + 1].pb(vec[i][k] | j); dp[i + 1][vec[i][k] | j] = 1; } } else break; } } } } 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 500 KB | Output is correct |
4 | Correct | 3 ms | 584 KB | Output is correct |
5 | Correct | 63 ms | 4564 KB | Output is correct |
6 | Correct | 2 ms | 4564 KB | Output is correct |
7 | Correct | 2 ms | 4564 KB | Output is correct |
8 | Correct | 61 ms | 4640 KB | Output is correct |
9 | Correct | 62 ms | 4640 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4640 KB | Output is correct |
2 | Correct | 2 ms | 4640 KB | Output is correct |
3 | Correct | 2 ms | 4640 KB | Output is correct |
4 | Correct | 2 ms | 4640 KB | Output is correct |
5 | Correct | 2 ms | 4640 KB | Output is correct |
6 | Incorrect | 2 ms | 4640 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 500 KB | Output is correct |
4 | Correct | 3 ms | 584 KB | Output is correct |
5 | Correct | 63 ms | 4564 KB | Output is correct |
6 | Correct | 2 ms | 4564 KB | Output is correct |
7 | Correct | 2 ms | 4564 KB | Output is correct |
8 | Correct | 61 ms | 4640 KB | Output is correct |
9 | Correct | 62 ms | 4640 KB | Output is correct |
10 | Correct | 2 ms | 4640 KB | Output is correct |
11 | Correct | 2 ms | 4640 KB | Output is correct |
12 | Correct | 2 ms | 4640 KB | Output is correct |
13 | Correct | 2 ms | 4640 KB | Output is correct |
14 | Correct | 2 ms | 4640 KB | Output is correct |
15 | Incorrect | 2 ms | 4640 KB | Output isn't correct |
16 | Halted | 0 ms | 0 KB | - |