oj.uz

Submission #535737

# Submission time Handle Problem Language Result Execution time Memory
535737 2022-03-11T05:19:10 Z nhquan Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 86732 KB 
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define ii pair<int, int>
#define vi vector<int>
#define ff first
#define ss second
#define sz(a) (int)a.size()

#define fto(i, a, b) for (int i = a; i <= b; ++i)
#define fdto(i, a, b) for (int i = a; i >= b; --i)

#define ll long long

#define oo 1000000007
#define maxN 21
#define maxM 21

using namespace std;

int n, m, a[maxN], b[maxM];
int f[maxN][(1 << maxN)];

int getBit(int i, int x) {
    return (x >> i) & 1;
}

int dp(int i, int S) {
    if (!i) return 1;
    if (f[i][S] != -1) return f[i][S];
    for (int T = S; T; T = (T-1)&S) {
        int tmp = 0;
        fto(j, 0, m-1) {
            if (getBit(j, T)) tmp += b[j+1];
        }
        if (tmp == a[i] && dp(i-1, S^T)) return f[i][S] = 1;
    }
    return f[i][S] = 0;
}

int main() {

    cin >> n >> m;
    fto(i, 1, n) {
        cin >> a[i];
    }

    fto(i, 1, m) {
        cin >> b[i];
    }

    fto(i, 0, n) {
        fto(S, 0, (1 << m)-1) {
            f[i][S] = -1;
        }
    }

    /*fto(S, 0, (1 << m)-1) {
        if (dp(n, S)) {
            cout << "YES\n";
            return 0;
        }
    }*/

    if (dp(n, (1 << m)-1)) {
        cout << "YES\n";
        return 0;
    }

    cout << "NO\n";

    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 62 ms 8404 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 59 ms 8508 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 9 ms 1364 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 62 ms 8404 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 59 ms 8508 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 9 ms 1364 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 852 KB Output is correct
29 Correct 2 ms 852 KB Output is correct
30 Correct 2 ms 1364 KB Output is correct
31 Correct 7 ms 12628 KB Output is correct
32 Correct 9 ms 16724 KB Output is correct
33 Correct 49 ms 33108 KB Output is correct
34 Correct 60 ms 45512 KB Output is correct
35 Correct 140 ms 49628 KB Output is correct
36 Correct 160 ms 86604 KB Output is correct
37 Correct 68 ms 12628 KB Output is correct
38 Correct 67 ms 20840 KB Output is correct
39 Correct 72 ms 37284 KB Output is correct
40 Correct 78 ms 45516 KB Output is correct
41 Correct 94 ms 86732 KB Output is correct
42 Correct 976 ms 24952 KB Output is correct
43 Correct 251 ms 37292 KB Output is correct
44 Correct 117 ms 66004 KB Output is correct
45 Correct 22 ms 16724 KB Output is correct
46 Correct 48 ms 28996 KB Output is correct
47 Correct 129 ms 65996 KB Output is correct
48 Correct 4 ms 8404 KB Output is correct
49 Correct 59 ms 8404 KB Output is correct
50 Correct 93 ms 86604 KB Output is correct
51 Correct 650 ms 45520 KB Output is correct
52 Execution timed out 1086 ms 45480 KB Time limit exceeded
53 Halted 0 ms 0 KB -