oj.uz

Submission #661251

# Submission time Handle Problem Language Result Execution time Memory
661251 2022-11-25T04:26:08 Z hafo Bank (IZhO14_bank) C++17
100 / 100
 519 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 ll oo = 1e15 + 69;

int n, m, a[maxn], b[maxn], dp[2][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];

    for(int i = 0; i < 2; i++)
        for(int mask = 0; mask < (1 << m); mask++) dp[i][mask] = -1;

    dp[0][(1 << m) - 1] = 0;
    for(int i = 0; i < n; i++)
        for(int mask = (1 << m) - 1; mask; mask--) {
            if(dp[i & 1][mask] != -1)
                for(int x = mask; x; x -= x&-x) {
                    int j = __builtin_ctz(x), s = dp[i & 1][mask] + b[j], add = (s == a[i]);
                    dp[i & 1 ^ add][mask ^ (1 << j)] = (add == 0 ? s:0);
                    if(i + add == n) {
                        cout<<"YES";
                        exit(0);
                    }
                }
            dp[i & 1][mask] = -1;
        }
    cout<<"NO";
    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:47:26: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   47 |                     dp[i & 1 ^ add][mask ^ (1 << j)] = (add == 0 ? s:0);
      |                        ~~^~~

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 66 ms 8508 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 66 ms 8404 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 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 1 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 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 72 ms 8504 KB Output is correct
32 Correct 103 ms 8508 KB Output is correct
33 Correct 118 ms 8404 KB Output is correct
34 Correct 122 ms 8512 KB Output is correct
35 Correct 125 ms 8508 KB Output is correct
36 Correct 134 ms 8504 KB Output is correct
37 Correct 85 ms 8500 KB Output is correct
38 Correct 72 ms 8512 KB Output is correct
39 Correct 18 ms 8404 KB Output is correct
40 Correct 83 ms 8500 KB Output is correct
41 Correct 87 ms 8500 KB Output is correct
42 Correct 145 ms 8404 KB Output is correct
43 Correct 101 ms 8404 KB Output is correct
44 Correct 77 ms 8404 KB Output is correct
45 Correct 115 ms 8508 KB Output is correct
46 Correct 121 ms 8404 KB Output is correct
47 Correct 103 ms 8404 KB Output is correct
48 Correct 3 ms 8404 KB Output is correct
49 Correct 68 ms 8404 KB Output is correct
50 Correct 466 ms 8504 KB Output is correct
51 Correct 176 ms 8504 KB Output is correct
52 Correct 242 ms 8520 KB Output is correct
53 Correct 237 ms 8508 KB Output is correct
54 Correct 519 ms 8516 KB Output is correct
55 Correct 469 ms 8500 KB Output is correct
56 Correct 493 ms 8528 KB Output is correct
57 Correct 435 ms 8504 KB Output is correct
58 Correct 437 ms 8504 KB Output is correct