oj.uz

Submission #944798

# Submission time Handle Problem Language Result Execution time Memory
944798 2024-03-13T05:12:37 Z ZHIRDILBILDIZ Bank (IZhO14_bank) C++14
100 / 100
 212 ms 8740 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
const int N = 20;
const int NS = 10;
int n, m;
int a[N];
int b[N];
int sum_a;
bool dp[(1 << N)];
bool abu[(1 << NS)][(1 << NS)];
vector<int> v[1001];
signed main() {
//    freopen("bank.in", "r", stdin);
//    freopen("bank.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        sum_a += a[i];
    }
    for (int i = 0; i < m; ++i)
        cin >> b[i];
    if (n > m) {
        cout << "NO\n";
        return 0;
    }
    if (n == 1) {
        for (int i = 0; i < (1 << m); ++i) {
            int sum = 0;
            for (int j = 0; j < m; ++j)
                sum += b[j] * ((i & (1 << j)) > 0);
            if (sum == a[0]) {
                cout << "YES\n";
                return 0;
            }
        }
        cout << "NO\n";
        return 0;
    }
    for (int i = 0; i < (1 << m); ++i) {
        int sum = 0;
        for (int j = 0; j < m; ++j)
            sum += b[j] * ((i & (1 << j)) > 0);
        if (sum <= 1e3)
            v[sum].push_back(i);
    }
    if (n <= 10 && m <= 10) {
        abu[0][0] = 1;
        for (int i = 0; i < (1 << m); ++i)
            for (int j = 0; j < (1 << n); ++j)
                for (int q = 0; q < n; ++q)
                    if (((1 << q) & j))
                        for (int z : v[a[q]])
                            if ((z & i) == z) {
                                abu[i][j] |= abu[i ^ z][j ^ (1 << q)];
                                if (abu[i][j] && j == (1 << n) - 1) {
                                    cout << "YES\n";
                                    return 0;
                                }
                            }
        cout << "NO\n";
        return 0;
    }
    vector<int> gr[2];
    gr[0].push_back(0);
    dp[0] = 1;
    for (int i = 0; i < n; ++i) {
        for (int j : gr[0])
            for (int q : v[a[i]]) {
                if ((j & q) || dp[j ^ q])
                    continue;
                if (i == n - 1) {
                    cout << "YES\n";
                    return 0;
                }
                dp[j ^ q] = 1;
                gr[1].push_back(j ^ q);
            }
        swap(gr[0], gr[1]);
        gr[1].clear();
    }
    cout << "NO\n";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 21 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 20 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1372 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 5 ms 1368 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 2 ms 1368 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1368 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 21 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 20 ms 348 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 1368 KB Output is correct
17 Correct 2 ms 1368 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 1368 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 24 ms 6492 KB Output is correct
32 Correct 45 ms 7260 KB Output is correct
33 Correct 22 ms 1876 KB Output is correct
34 Correct 20 ms 344 KB Output is correct
35 Correct 20 ms 348 KB Output is correct
36 Correct 23 ms 348 KB Output is correct
37 Correct 25 ms 604 KB Output is correct
38 Correct 24 ms 604 KB Output is correct
39 Correct 28 ms 6820 KB Output is correct
40 Correct 22 ms 2136 KB Output is correct
41 Correct 21 ms 1008 KB Output is correct
42 Correct 28 ms 6744 KB Output is correct
43 Correct 22 ms 2384 KB Output is correct
44 Correct 20 ms 348 KB Output is correct
45 Correct 25 ms 7772 KB Output is correct
46 Correct 24 ms 4432 KB Output is correct
47 Correct 20 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 19 ms 360 KB Output is correct
50 Correct 89 ms 8472 KB Output is correct
51 Correct 24 ms 6232 KB Output is correct
52 Correct 25 ms 6320 KB Output is correct
53 Correct 212 ms 7008 KB Output is correct
54 Correct 105 ms 8216 KB Output is correct
55 Correct 88 ms 8468 KB Output is correct
56 Correct 82 ms 8692 KB Output is correct
57 Correct 88 ms 8740 KB Output is correct
58 Correct 86 ms 8736 KB Output is correct