oj.uz

Submission #468483

# Submission time Handle Problem Language Result Execution time Memory
468483 2021-08-28T13:34:44 Z Shin Bank (IZhO14_bank) C++14
100 / 100
 130 ms 8512 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK "file"
#define all(x) x.begin(), x.end()
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)

using namespace std;
const int N = 2e5 + 7;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const long long INFLL = 1e18 + 7;

typedef long long ll;
typedef long double ld;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

int n, m;
int bank[22];
int salary[22];
int dp[1 << 20];
int remain[1 << 20];

void solve(void) {
    cin >> n >> m;
    for (int i = 0; i < n; i ++) cin >> salary[i];
    for (int i = 0; i < m; i ++) cin >> bank[i];

    memset(dp, -1, sizeof dp);
    dp[0] = 0;

    for (int mask = 0; mask < 1 << m; mask ++) {
        for (int i = 0; i < m ; i ++) if (BIT(mask, i)) {
            int nmask = mask ^ MASK(i);
            if (dp[nmask] < 0) continue;

            if (remain[nmask] + bank[i] < salary[dp[nmask]]) {
                dp[mask] = dp[nmask];
                remain[mask] = remain[nmask] + bank[i];
            } else
            if (remain[nmask] + bank[i] == salary[dp[nmask]]) {
                dp[mask] = dp[nmask] + 1;
                remain[mask] = 0;
            }
            if (dp[mask] == n) 
                return void (cout << "YES");
        }
    }
    cout <<"NO";
}

int main(void) {
    ios_base::sync_with_stdio(0); 
    cin.tie(0);
    
    int test = 1;
    // cin >> test;
    while (test --) {
        solve();
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 3 ms 4300 KB Output is correct
3 Correct 2 ms 4300 KB Output is correct
4 Correct 2 ms 4300 KB Output is correct
5 Correct 75 ms 4432 KB Output is correct
6 Correct 3 ms 4300 KB Output is correct
7 Correct 3 ms 4300 KB Output is correct
8 Correct 3 ms 4428 KB Output is correct
9 Correct 104 ms 8432 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4300 KB Output is correct
2 Correct 3 ms 4300 KB Output is correct
3 Correct 2 ms 4300 KB Output is correct
4 Correct 2 ms 4300 KB Output is correct
5 Correct 75 ms 4432 KB Output is correct
6 Correct 3 ms 4300 KB Output is correct
7 Correct 3 ms 4300 KB Output is correct
8 Correct 3 ms 4428 KB Output is correct
9 Correct 104 ms 8432 KB Output is correct
10 Correct 3 ms 4392 KB Output is correct
11 Correct 3 ms 4428 KB Output is correct
12 Correct 3 ms 4428 KB Output is correct
13 Correct 2 ms 4428 KB Output is correct
14 Correct 3 ms 4428 KB Output is correct
15 Correct 3 ms 4300 KB Output is correct
16 Correct 3 ms 4416 KB Output is correct
17 Correct 3 ms 4300 KB Output is correct
18 Correct 3 ms 4300 KB Output is correct
19 Correct 3 ms 4428 KB Output is correct
20 Correct 3 ms 4428 KB Output is correct
21 Correct 4 ms 4384 KB Output is correct
22 Correct 3 ms 4428 KB Output is correct
23 Correct 3 ms 4416 KB Output is correct
24 Correct 4 ms 4428 KB Output is correct
25 Correct 4 ms 4428 KB Output is correct
26 Correct 4 ms 4428 KB Output is correct
27 Correct 3 ms 4428 KB Output is correct
28 Correct 4 ms 4428 KB Output is correct
29 Correct 3 ms 4452 KB Output is correct
30 Correct 3 ms 4428 KB Output is correct
31 Correct 114 ms 8440 KB Output is correct
32 Correct 120 ms 8420 KB Output is correct
33 Correct 87 ms 8512 KB Output is correct
34 Correct 74 ms 5440 KB Output is correct
35 Correct 74 ms 5536 KB Output is correct
36 Correct 73 ms 4632 KB Output is correct
37 Correct 75 ms 4740 KB Output is correct
38 Correct 75 ms 4536 KB Output is correct
39 Correct 2 ms 4300 KB Output is correct
40 Correct 76 ms 4548 KB Output is correct
41 Correct 75 ms 4492 KB Output is correct
42 Correct 129 ms 8468 KB Output is correct
43 Correct 77 ms 6852 KB Output is correct
44 Correct 72 ms 4440 KB Output is correct
45 Correct 3 ms 4428 KB Output is correct
46 Correct 103 ms 8472 KB Output is correct
47 Correct 74 ms 4648 KB Output is correct
48 Correct 2 ms 4428 KB Output is correct
49 Correct 76 ms 4492 KB Output is correct
50 Correct 106 ms 8384 KB Output is correct
51 Correct 74 ms 4676 KB Output is correct
52 Correct 80 ms 8388 KB Output is correct
53 Correct 130 ms 8384 KB Output is correct
54 Correct 119 ms 8468 KB Output is correct
55 Correct 106 ms 8404 KB Output is correct
56 Correct 101 ms 8472 KB Output is correct
57 Correct 107 ms 8472 KB Output is correct
58 Correct 102 ms 8416 KB Output is correct