oj.uz

Submission #881237

# Submission time Handle Problem Language Result Execution time Memory
881237 2023-12-01T00:01:19 Z __Davit__ Bank (IZhO14_bank) C++17
100 / 100
 100 ms 8808 KB 
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define vr(v) v.begin(),v.end()
#define rv(v) v.rbegin(),v.rend()
#define Code ios_base::sync_with_stdio(false);
#define By cin.tie(NULL);
#define Davit cout.tie(NULL);
using namespace std;

//#include "algo/debug.h"
//mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
//mt19937_64 myrand(373);
//mt19937 myrand(373);

const int N = 20, M = (1 << N);
int a[N], b[N];
pair<int, int> dp[M];


int main() {
    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 i = 1; i < M; ++i) dp[i] = {-1, 0};

    for (int mask = 1; mask < (1 << m); mask++) {
        for (int i = 0; i < m; i++) {
            if ((mask >> i) & 1) {
                pair<int, int> dpj = dp[mask ^ (1 << i)];
                if (dpj.ff == -1)continue;
                if (dpj.ss + b[i] < a[dpj.ff]) {
                    dp[mask] = {dpj.ff, dpj.ss + b[i]};
                } else if (dpj.ss + b[i] == a[dpj.ff]) {
                    dp[mask] = {dpj.ff + 1, 0};
                }
            }
        }
        if (dp[mask].ff == n) {
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO\n";

}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8548 KB Output is correct
2 Correct 2 ms 8552 KB Output is correct
3 Correct 2 ms 8552 KB Output is correct
4 Correct 2 ms 8648 KB Output is correct
5 Correct 70 ms 8552 KB Output is correct
6 Correct 2 ms 8552 KB Output is correct
7 Correct 2 ms 8552 KB Output is correct
8 Correct 3 ms 8552 KB Output is correct
9 Correct 72 ms 8552 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8552 KB Output is correct
2 Correct 3 ms 8512 KB Output is correct
3 Correct 2 ms 8548 KB Output is correct
4 Correct 2 ms 8552 KB Output is correct
5 Correct 2 ms 8440 KB Output is correct
6 Correct 3 ms 8808 KB Output is correct
7 Correct 2 ms 8552 KB Output is correct
8 Correct 3 ms 8552 KB Output is correct
9 Correct 2 ms 8552 KB Output is correct
10 Correct 2 ms 8552 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8552 KB Output is correct
2 Correct 4 ms 8552 KB Output is correct
3 Correct 4 ms 8552 KB Output is correct
4 Correct 3 ms 8552 KB Output is correct
5 Correct 3 ms 8552 KB Output is correct
6 Correct 3 ms 8552 KB Output is correct
7 Correct 4 ms 8548 KB Output is correct
8 Correct 3 ms 8544 KB Output is correct
9 Correct 4 ms 8548 KB Output is correct
10 Correct 3 ms 8548 KB Output is correct
11 Correct 4 ms 8800 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8548 KB Output is correct
2 Correct 2 ms 8552 KB Output is correct
3 Correct 2 ms 8552 KB Output is correct
4 Correct 2 ms 8648 KB Output is correct
5 Correct 70 ms 8552 KB Output is correct
6 Correct 2 ms 8552 KB Output is correct
7 Correct 2 ms 8552 KB Output is correct
8 Correct 3 ms 8552 KB Output is correct
9 Correct 72 ms 8552 KB Output is correct
10 Correct 3 ms 8552 KB Output is correct
11 Correct 3 ms 8512 KB Output is correct
12 Correct 2 ms 8548 KB Output is correct
13 Correct 2 ms 8552 KB Output is correct
14 Correct 2 ms 8440 KB Output is correct
15 Correct 3 ms 8808 KB Output is correct
16 Correct 2 ms 8552 KB Output is correct
17 Correct 3 ms 8552 KB Output is correct
18 Correct 2 ms 8552 KB Output is correct
19 Correct 2 ms 8552 KB Output is correct
20 Correct 3 ms 8552 KB Output is correct
21 Correct 4 ms 8552 KB Output is correct
22 Correct 4 ms 8552 KB Output is correct
23 Correct 3 ms 8552 KB Output is correct
24 Correct 3 ms 8552 KB Output is correct
25 Correct 3 ms 8552 KB Output is correct
26 Correct 4 ms 8548 KB Output is correct
27 Correct 3 ms 8544 KB Output is correct
28 Correct 4 ms 8548 KB Output is correct
29 Correct 3 ms 8548 KB Output is correct
30 Correct 4 ms 8800 KB Output is correct
31 Correct 89 ms 8628 KB Output is correct
32 Correct 87 ms 8624 KB Output is correct
33 Correct 81 ms 8624 KB Output is correct
34 Correct 70 ms 8632 KB Output is correct
35 Correct 71 ms 8636 KB Output is correct
36 Correct 72 ms 8620 KB Output is correct
37 Correct 70 ms 8616 KB Output is correct
38 Correct 71 ms 8620 KB Output is correct
39 Correct 3 ms 8540 KB Output is correct
40 Correct 70 ms 8616 KB Output is correct
41 Correct 70 ms 8540 KB Output is correct
42 Correct 100 ms 8540 KB Output is correct
43 Correct 71 ms 8616 KB Output is correct
44 Correct 71 ms 8620 KB Output is correct
45 Correct 4 ms 8536 KB Output is correct
46 Correct 83 ms 8616 KB Output is correct
47 Correct 78 ms 8540 KB Output is correct
48 Correct 3 ms 8540 KB Output is correct
49 Correct 72 ms 8540 KB Output is correct
50 Correct 78 ms 8540 KB Output is correct
51 Correct 71 ms 8788 KB Output is correct
52 Correct 69 ms 8536 KB Output is correct
53 Correct 88 ms 8540 KB Output is correct
54 Correct 85 ms 8536 KB Output is correct
55 Correct 81 ms 8536 KB Output is correct
56 Correct 79 ms 8624 KB Output is correct
57 Correct 76 ms 8544 KB Output is correct
58 Correct 77 ms 8616 KB Output is correct