oj.uz

Submission #868386

# Submission time Handle Problem Language Result Execution time Memory
868386 2023-10-31T10:31:23 Z LOLOLO Bank (IZhO14_bank) C++14
100 / 100
 103 ms 10684 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = (1 << 20);
int dp[N], l[N], a[N], b[N];

string solve() {
    mem(dp, -1);
    dp[0] = 0;

    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; i++) 
        cin >> a[i];

    for (int i = 0; i < m; i++)
        cin >> b[i];

    for (int mask = 1; mask < (1 << m); mask++) {
        for (int i = 0; i < m; i++) {
            if ((mask & (1 << i)) == 0) 
                continue;

            int m1 = mask ^ (1 << i);
            if (dp[m1] == -1)
                continue;

            int r = l[m1] + b[i];
            if (r < a[dp[m1]]) {
                dp[mask] = dp[m1];
                l[mask] = r;
            } else if (r == a[dp[m1]]) {
                dp[mask] = dp[m1] + 1;
                l[mask] = 0;
            }
        }

        if (dp[mask] == n)
            return "YES";
    }

    return "NO";
}

int main() {
    int t = 1;

    while (t--) {
        cout << solve() << '\n';
    }
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8280 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 66 ms 10508 KB Output is correct
6 Correct 2 ms 8280 KB Output is correct
7 Correct 2 ms 8460 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 82 ms 10512 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8280 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 66 ms 10508 KB Output is correct
6 Correct 2 ms 8280 KB Output is correct
7 Correct 2 ms 8460 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 82 ms 10512 KB Output is correct
10 Correct 2 ms 8284 KB Output is correct
11 Correct 2 ms 8452 KB Output is correct
12 Correct 2 ms 8464 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 2 ms 8284 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 2 ms 8284 KB Output is correct
18 Correct 2 ms 8284 KB Output is correct
19 Correct 2 ms 8456 KB Output is correct
20 Correct 3 ms 8280 KB Output is correct
21 Correct 3 ms 8284 KB Output is correct
22 Correct 2 ms 8284 KB Output is correct
23 Correct 2 ms 8284 KB Output is correct
24 Correct 2 ms 8284 KB Output is correct
25 Correct 3 ms 8284 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 2 ms 8284 KB Output is correct
28 Correct 2 ms 8284 KB Output is correct
29 Correct 3 ms 8284 KB Output is correct
30 Correct 2 ms 8540 KB Output is correct
31 Correct 94 ms 10680 KB Output is correct
32 Correct 94 ms 10588 KB Output is correct
33 Correct 76 ms 10680 KB Output is correct
34 Correct 66 ms 10616 KB Output is correct
35 Correct 69 ms 10588 KB Output is correct
36 Correct 67 ms 10328 KB Output is correct
37 Correct 65 ms 10332 KB Output is correct
38 Correct 68 ms 10520 KB Output is correct
39 Correct 2 ms 8280 KB Output is correct
40 Correct 68 ms 10544 KB Output is correct
41 Correct 66 ms 10332 KB Output is correct
42 Correct 103 ms 10584 KB Output is correct
43 Correct 68 ms 10584 KB Output is correct
44 Correct 66 ms 10332 KB Output is correct
45 Correct 2 ms 8280 KB Output is correct
46 Correct 84 ms 10588 KB Output is correct
47 Correct 65 ms 10544 KB Output is correct
48 Correct 2 ms 8284 KB Output is correct
49 Correct 66 ms 10332 KB Output is correct
50 Correct 86 ms 10676 KB Output is correct
51 Correct 73 ms 10588 KB Output is correct
52 Correct 67 ms 10584 KB Output is correct
53 Correct 98 ms 10676 KB Output is correct
54 Correct 92 ms 10588 KB Output is correct
55 Correct 86 ms 10680 KB Output is correct
56 Correct 87 ms 10584 KB Output is correct
57 Correct 102 ms 10684 KB Output is correct
58 Correct 89 ms 10588 KB Output is correct