oj.uz

Submission #661282

# Submission time Handle Problem Language Result Execution time Memory
661282 2022-11-25T07:46:09 Z hafo Bank (IZhO14_bank) C++14
100 / 100
 36 ms 8528 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 20;
const int oo = 1e9 + 69;

int n, m, a[maxn], b[maxn];
pa dp[1 << maxn];

bool getbit(const int mask, int i) {
    return ((mask >> i) & 1);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n>>m;
    for(int i = 0; i < n; i++) cin>>a[i];
    for(int i = 0; i < m; i++) cin>>b[i];

    fill_n(dp, (1 << m), make_pair(-1, 0));
    dp[(1 << m) - 1] = {0, 0};
    for(int mask = (1 << m) - 1; mask; mask--)
        if(dp[mask].fi != -1)
            for(int x = mask; x; x -= x&-x) {
                int i = dp[mask].fi, j = __builtin_ctz(x), s = dp[mask].se + b[j], cur = (mask ^ (1 << j));
                if(s < a[i]) {
                    dp[cur] = {i, s};
                } else if(s == a[i]) {
                    dp[cur] = {i + 1, 0};
                }
                if(dp[cur].fi == n) {
                    cout<<"YES";
                    return 0;
                }
            }
    cout<<"NO";
    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 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 32 ms 8508 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 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
11 Correct 1 ms 340 KB Output is correct

Subtask #4
29.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 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 32 ms 8508 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 20 ms 8404 KB Output is correct
32 Correct 22 ms 8520 KB Output is correct
33 Correct 7 ms 8404 KB Output is correct
34 Correct 4 ms 8404 KB Output is correct
35 Correct 5 ms 8404 KB Output is correct
36 Correct 5 ms 8404 KB Output is correct
37 Correct 5 ms 8404 KB Output is correct
38 Correct 5 ms 8404 KB Output is correct
39 Correct 6 ms 8404 KB Output is correct
40 Correct 5 ms 8404 KB Output is correct
41 Correct 5 ms 8524 KB Output is correct
42 Correct 32 ms 8404 KB Output is correct
43 Correct 6 ms 8404 KB Output is correct
44 Correct 7 ms 8528 KB Output is correct
45 Correct 4 ms 8404 KB Output is correct
46 Correct 10 ms 8524 KB Output is correct
47 Correct 5 ms 8404 KB Output is correct
48 Correct 4 ms 8404 KB Output is correct
49 Correct 5 ms 8404 KB Output is correct
50 Correct 20 ms 8520 KB Output is correct
51 Correct 6 ms 8404 KB Output is correct
52 Correct 7 ms 8404 KB Output is correct
53 Correct 22 ms 8404 KB Output is correct
54 Correct 19 ms 8520 KB Output is correct
55 Correct 21 ms 8520 KB Output is correct
56 Correct 20 ms 8404 KB Output is correct
57 Correct 36 ms 8404 KB Output is correct
58 Correct 24 ms 8524 KB Output is correct