oj.uz

Submission #594173

# Submission time Handle Problem Language Result Execution time Memory
594173 2022-07-12T07:36:00 Z vbee Bank (IZhO14_bank) C++14
100 / 100
 86 ms 8592 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define all(r) (r).begin(), (r).end()
#define MASK(i) (1 << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define ll long long
#define pb push_back
#define TASK "task"
 
using namespace std;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
 
const int oo = 1e9 + 7;
const ll loo = (ll)1e18 + 7;
const int LOG = 18;
const int BASE = 323;
const int N = 20;
 
int n, m, a[N], b[N];
int f[MASK(N)], leftover[MASK(N)];
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    // freopen(TASK".inp", "r", stdin);
    // freopen(TASK".out", "w", stdout);
    cin >> n >> m;
    int totsum = 0;
    for (int i = 0; i < n; i++) cin >> a[i], totsum += a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    memset(f, -1, sizeof f);
    memset(leftover, -1, sizeof leftover);
    f[0] = 0, leftover[0] = 0;
    for (int mask = 0; mask < MASK(m); mask++) if (f[mask] != -1) {
        for (int i = 0; i < m; i++) if (!BIT(mask, i)){
            int amt = leftover[mask] + b[i];
            int cur = a[f[mask]];
            if (amt < cur){
                leftover[mask ^ MASK(i)] = amt;
                f[mask ^ MASK(i)] = f[mask];
            }
            else if (amt == cur){
                f[mask ^ MASK(i)] = f[mask] + 1;
                leftover[mask ^ MASK(i)] = 0;
            }
            if (f[mask ^ MASK(i)] == n) return cout << "YES\n", 0;
        }
    }
    cout << "NO\n";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8404 KB Output is correct
2 Correct 4 ms 8404 KB Output is correct
3 Correct 4 ms 8404 KB Output is correct
4 Correct 5 ms 8404 KB Output is correct
5 Correct 4 ms 8512 KB Output is correct
6 Correct 4 ms 8404 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 70 ms 8404 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 3 ms 8404 KB Output is correct
3 Correct 4 ms 8404 KB Output is correct
4 Correct 3 ms 8404 KB Output is correct
5 Correct 4 ms 8404 KB Output is correct
6 Correct 4 ms 8404 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 3 ms 8404 KB Output is correct
10 Correct 4 ms 8404 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 5 ms 8404 KB Output is correct
3 Correct 4 ms 8404 KB Output is correct
4 Correct 3 ms 8404 KB Output is correct
5 Correct 4 ms 8412 KB Output is correct
6 Correct 4 ms 8492 KB Output is correct
7 Correct 6 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 4 ms 8404 KB Output is correct
10 Correct 3 ms 8404 KB Output is correct
11 Correct 6 ms 8404 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8404 KB Output is correct
2 Correct 4 ms 8404 KB Output is correct
3 Correct 4 ms 8404 KB Output is correct
4 Correct 5 ms 8404 KB Output is correct
5 Correct 4 ms 8512 KB Output is correct
6 Correct 4 ms 8404 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 70 ms 8404 KB Output is correct
10 Correct 4 ms 8404 KB Output is correct
11 Correct 3 ms 8404 KB Output is correct
12 Correct 4 ms 8404 KB Output is correct
13 Correct 3 ms 8404 KB Output is correct
14 Correct 4 ms 8404 KB Output is correct
15 Correct 4 ms 8404 KB Output is correct
16 Correct 4 ms 8404 KB Output is correct
17 Correct 4 ms 8404 KB Output is correct
18 Correct 3 ms 8404 KB Output is correct
19 Correct 4 ms 8404 KB Output is correct
20 Correct 4 ms 8404 KB Output is correct
21 Correct 5 ms 8404 KB Output is correct
22 Correct 4 ms 8404 KB Output is correct
23 Correct 3 ms 8404 KB Output is correct
24 Correct 4 ms 8412 KB Output is correct
25 Correct 4 ms 8492 KB Output is correct
26 Correct 6 ms 8404 KB Output is correct
27 Correct 4 ms 8404 KB Output is correct
28 Correct 4 ms 8404 KB Output is correct
29 Correct 3 ms 8404 KB Output is correct
30 Correct 6 ms 8404 KB Output is correct
31 Correct 43 ms 8404 KB Output is correct
32 Correct 44 ms 8500 KB Output is correct
33 Correct 8 ms 8404 KB Output is correct
34 Correct 4 ms 8592 KB Output is correct
35 Correct 6 ms 8404 KB Output is correct
36 Correct 5 ms 8404 KB Output is correct
37 Correct 4 ms 8404 KB Output is correct
38 Correct 4 ms 8404 KB Output is correct
39 Correct 4 ms 8404 KB Output is correct
40 Correct 6 ms 8452 KB Output is correct
41 Correct 4 ms 8404 KB Output is correct
42 Correct 50 ms 8404 KB Output is correct
43 Correct 6 ms 8404 KB Output is correct
44 Correct 5 ms 8404 KB Output is correct
45 Correct 4 ms 8404 KB Output is correct
46 Correct 17 ms 8408 KB Output is correct
47 Correct 4 ms 8464 KB Output is correct
48 Correct 4 ms 8404 KB Output is correct
49 Correct 4 ms 8404 KB Output is correct
50 Correct 45 ms 8504 KB Output is correct
51 Correct 5 ms 8464 KB Output is correct
52 Correct 5 ms 8404 KB Output is correct
53 Correct 52 ms 8404 KB Output is correct
54 Correct 43 ms 8404 KB Output is correct
55 Correct 41 ms 8500 KB Output is correct
56 Correct 42 ms 8404 KB Output is correct
57 Correct 86 ms 8504 KB Output is correct
58 Correct 45 ms 8404 KB Output is correct