oj.uz

Submission #660112

# Submission time Handle Problem Language Result Execution time Memory
660112 2022-11-20T11:20:29 Z bojackduy Bank (IZhO14_bank) C++14
100 / 100
 61 ms 8504 KB 
#include <iostream>
#include <queue>
#include <stack>
#include <algorithm>
#include <string.h>
#include <functional>
#define task ""
#define size() size() * 1ll 
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define MASK(x) (1LL << (x))
#define BIT(x,i) (((x) >> (i)) & 1)
#define numbit(x) __builtin_popcountll(x)

using namespace std;

typedef vector<int> vi;
typedef vector<pii> vii;
typedef long long ll;

template<class t>
bool mini(t &x,t y) {
    if (y < x) {
       x = y;
       return 1;
    }
return 0;
}
template<class t>
bool maxi(t &x,t y) {
    if (x < y) {
       x = y;
       return 1;
    }
return 0;
}

const int N = 1e6 + 1;
const int M = 1e3 + 1;
const long long mod = 1e9 + 7;
const long long oo = 1e18 + 7;

int n, m;
int a[20], b[20];
int dp[MASK(20)], lefover[MASK(20)];
void solve(int test = -1) {
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    memset(dp, -1, sizeof dp);
    dp[0] = 0, lefover[0] = 0;
    for (int mask = 1; mask < MASK(m); mask++) {
        for (int msk = mask; msk > 0; msk -= msk & -msk) {
            int i = __builtin_ctz(msk);
            if (dp[mask ^ MASK(i)] == -1) continue;
            int sum = lefover[mask ^ MASK(i)] + b[i];
            if (sum < a[dp[mask ^ MASK(i)]]) {
                if (maxi(dp[mask], dp[mask ^ MASK(i)]))
                    lefover[mask] = sum;
            } else if (sum == a[dp[mask ^ MASK(i)]]) {
                if (maxi(dp[mask], dp[mask ^ MASK(i)] + 1)) {
                    lefover[mask] = 0;
                }
            }
            if (dp[mask] == n) return void (cout << "YES");
        }
    }
    cout << "NO";
}

int32_t main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    // freopen(task".inp", "r", stdin);
    // freopen(task".out", "w", stdout);

    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++) {
        solve(i);
    }
return 0;
}
/*

*/

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 19 ms 4448 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 35 ms 8396 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 19 ms 4448 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 35 ms 8396 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 2 ms 4308 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 2 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 2 ms 4436 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4436 KB Output is correct
21 Correct 2 ms 4436 KB Output is correct
22 Correct 2 ms 4436 KB Output is correct
23 Correct 2 ms 4308 KB Output is correct
24 Correct 2 ms 4436 KB Output is correct
25 Correct 3 ms 4308 KB Output is correct
26 Correct 3 ms 4436 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 2 ms 4436 KB Output is correct
29 Correct 2 ms 4436 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 44 ms 8400 KB Output is correct
32 Correct 54 ms 8416 KB Output is correct
33 Correct 29 ms 8412 KB Output is correct
34 Correct 21 ms 5428 KB Output is correct
35 Correct 21 ms 5492 KB Output is correct
36 Correct 20 ms 4692 KB Output is correct
37 Correct 19 ms 4760 KB Output is correct
38 Correct 18 ms 4436 KB Output is correct
39 Correct 2 ms 4308 KB Output is correct
40 Correct 19 ms 4504 KB Output is correct
41 Correct 19 ms 4564 KB Output is correct
42 Correct 61 ms 8460 KB Output is correct
43 Correct 27 ms 6864 KB Output is correct
44 Correct 19 ms 4436 KB Output is correct
45 Correct 3 ms 4436 KB Output is correct
46 Correct 40 ms 8468 KB Output is correct
47 Correct 19 ms 4564 KB Output is correct
48 Correct 2 ms 4436 KB Output is correct
49 Correct 19 ms 4532 KB Output is correct
50 Correct 38 ms 8412 KB Output is correct
51 Correct 19 ms 4768 KB Output is correct
52 Correct 24 ms 8396 KB Output is correct
53 Correct 44 ms 8504 KB Output is correct
54 Correct 38 ms 8416 KB Output is correct
55 Correct 39 ms 8400 KB Output is correct
56 Correct 37 ms 8436 KB Output is correct
57 Correct 37 ms 8444 KB Output is correct
58 Correct 38 ms 8420 KB Output is correct