oj.uz

Submission #504945

# Submission time Handle Problem Language Result Execution time Memory
504945 2022-01-10T10:54:33 Z KiriLL1ca Bank (IZhO14_bank) C++17
100 / 100
 841 ms 4520 KB 
#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define endl '\n'
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define sqr(x) ((ll)x)*((ll)x)
#define bcnt(X) __builtin_popcountll(X)
#define vec vector

#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

auto rng = bind(uniform_int_distribution<int>(1, 1e9), mt19937(228));

signed main ()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, m; cin >> n >> m;
    vector <int> a (n), b (m);
    for (auto &i : a) cin >> i;
    for (auto &i : b) cin >> i;
    vector <vector <int>> sim (n);
    for (int msk = 0; msk < pw(m); msk++) {
        int sum = 0;
        for (int j = 0; j < m; j++) {
            if ((msk >> j) & 1) sum += b[j];
        }
        for (int i = 0; i < n; i++) {
            if (sum == a[i]) sim[i].pb(msk);
        }
    }

    vector <int> dp (pw(m), -1);
    dp[0] = 0;
    for (int i = 0; i < n; i++) {
        for (int msk = pw(m) - 1; msk >= 0; msk--) {
            if (dp[msk] != -1) {
                for (auto p : sim[i]) {
                    if (p & msk) continue;
                    int mask = p | msk;
                    dp[mask] = max(dp[mask], dp[msk] + 1);
                    if (dp[mask] == n) {
                        cout << "YES" << endl;
                        return 0;
                    }
                }
            }
        }
    }
    cout << "NO" << endl;
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 59 ms 4408 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 52 ms 4432 KB Output is correct
9 Correct 58 ms 4384 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 59 ms 4408 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 52 ms 4432 KB Output is correct
9 Correct 58 ms 4384 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 284 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 57 ms 4404 KB Output is correct
32 Correct 86 ms 4520 KB Output is correct
33 Correct 64 ms 4400 KB Output is correct
34 Correct 64 ms 4388 KB Output is correct
35 Correct 64 ms 4400 KB Output is correct
36 Correct 87 ms 4400 KB Output is correct
37 Correct 57 ms 4404 KB Output is correct
38 Correct 63 ms 4404 KB Output is correct
39 Correct 70 ms 4396 KB Output is correct
40 Correct 68 ms 4384 KB Output is correct
41 Correct 79 ms 4404 KB Output is correct
42 Correct 82 ms 4408 KB Output is correct
43 Correct 70 ms 4392 KB Output is correct
44 Correct 77 ms 4400 KB Output is correct
45 Correct 60 ms 4292 KB Output is correct
46 Correct 57 ms 4392 KB Output is correct
47 Correct 75 ms 4384 KB Output is correct
48 Correct 51 ms 4404 KB Output is correct
49 Correct 50 ms 4396 KB Output is correct
50 Correct 555 ms 4296 KB Output is correct
51 Correct 550 ms 4420 KB Output is correct
52 Correct 354 ms 4424 KB Output is correct
53 Correct 841 ms 4436 KB Output is correct
54 Correct 631 ms 4416 KB Output is correct
55 Correct 551 ms 4396 KB Output is correct
56 Correct 650 ms 4400 KB Output is correct
57 Correct 753 ms 4416 KB Output is correct
58 Correct 632 ms 4420 KB Output is correct