oj.uz

Submission #338414

# Submission time Handle Problem Language Result Execution time Memory
338414 2020-12-23T05:31:47 Z Dilshod_Imomov Bank (IZhO14_bank) C++17
100 / 100
 415 ms 10860 KB 
# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second

using namespace std;

const int N = 2e6 + 7;
const int mod = 1e9 + 7;

int n, m, a[23], b[23];
vector < int > vc[1007];
bool used[23][N];

void rec( int i, int mask ) {
    if ( i < 0 ) {
        cout << "YES";
        exit(0);
    }
    if ( used[i][mask] ) {
        return;
    }
    used[i][mask] = 1;
    for ( auto msk: vc[ a[i] ] ) {
        if ( (mask & msk) == msk ) {
            rec( i - 1, (mask ^ msk) );
        }
    }
}

int32_t main() {
    speed;
    cin >> n >> m;
    for ( int i = 0; i < n; i++ ) {
        cin >> a[i];
    }
    for ( int j = 0; j < m; j++ ) {
        cin >> b[j];
    }
    for ( int mask = 0; mask < (1 << m); mask++ ) {
        int sum = 0;
        for ( int bit = 0; bit < m; bit++ ) {
            if ( (mask >> bit) & 1 ) {
                sum += b[bit];
            }
        }
        for ( int i = 0; i < n; i++ ) {
            if ( sum == a[i] ) {
                vc[ a[i] ].push_back(mask);
                // cout << a[i] << ' ' << mask << endl;
            }
        }
    }
    rec( n - 1, (1 << (m)) - 1 );
    cout << "NO";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 65 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 65 ms 488 KB Output is correct
9 Correct 64 ms 424 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 65 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 65 ms 488 KB Output is correct
9 Correct 64 ms 424 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 65 ms 492 KB Output is correct
32 Correct 66 ms 748 KB Output is correct
33 Correct 70 ms 364 KB Output is correct
34 Correct 75 ms 492 KB Output is correct
35 Correct 75 ms 492 KB Output is correct
36 Correct 83 ms 492 KB Output is correct
37 Correct 66 ms 364 KB Output is correct
38 Correct 67 ms 364 KB Output is correct
39 Correct 72 ms 492 KB Output is correct
40 Correct 75 ms 364 KB Output is correct
41 Correct 81 ms 364 KB Output is correct
42 Correct 74 ms 3948 KB Output is correct
43 Correct 73 ms 2284 KB Output is correct
44 Correct 90 ms 492 KB Output is correct
45 Correct 69 ms 492 KB Output is correct
46 Correct 70 ms 620 KB Output is correct
47 Correct 80 ms 492 KB Output is correct
48 Correct 64 ms 492 KB Output is correct
49 Correct 64 ms 364 KB Output is correct
50 Correct 81 ms 492 KB Output is correct
51 Correct 86 ms 1516 KB Output is correct
52 Correct 415 ms 4844 KB Output is correct
53 Correct 74 ms 620 KB Output is correct
54 Correct 83 ms 620 KB Output is correct
55 Correct 81 ms 492 KB Output is correct
56 Correct 84 ms 492 KB Output is correct
57 Correct 207 ms 10860 KB Output is correct
58 Correct 82 ms 492 KB Output is correct