oj.uz

Submission #664656

# Submission time Handle Problem Language Result Execution time Memory
664656 2022-11-27T08:07:25 Z longvu Bank (IZhO14_bank) C++14
19 / 100
 78 ms 21000 KB 
/**
 *    author:  longvu
 *    created: 11/27/22 14:55:09
**/
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
const int INF = numeric_limits<int>::max();
const int naxn = (int)(21);
const int naxm = (int)(19001);
const int mod = 1e9 + 7;

template<class X, class Y>
bool maximize(X& x, const Y y) {
    if (y > x) {x = y; return true;}
    return false;
}
template<class X, class Y>
bool minimize(X& x, const Y y) {
    if (y < x) {x = y; return true;}
    return false;
}

int a[naxn], b[naxn], cnt[(1 << naxn)];
vector<int> memo[naxm];
bitset<(1 << naxn)> vis[naxn], dp[naxn];
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    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 mask = 0; mask < (1 << m); ++mask) {
        int sum = 0;
        for (int i = 0; i < m; ++i) {
            if (mask & (1 << i)) {
                sum += b[i];
            }
        }
        cnt[mask] = __builtin_popcount(mask);
        memo[sum].push_back(mask);
    }
    function<bool(int, int)> solve = [&](int i, int mask) {
        if (i == n) {
            return true;
        }
        if (vis[i][mask]) {
            return (bool)(dp[i][mask]); 
        }
        bool res = false;
        for (auto z : memo[a[i]]) {
            if (!(mask & z) && n - cnt[mask] + cnt[z] >= n - 1 - i &&  solve(i + 1, mask | z)) {
                res = true;
                break;
            }
        }
        vis[i][mask] = true;
        dp[i][mask] = res;
        return res;
    };
    cout << (solve(0, 0) ? "YES" : "NO") << '\n';
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 4 ms 1364 KB Output is correct
5 Correct 78 ms 21000 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 76 ms 19720 KB Output is correct
9 Correct 75 ms 20308 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 780 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Incorrect 1 ms 852 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 4 ms 1364 KB Output is correct
5 Correct 78 ms 21000 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 76 ms 19720 KB Output is correct
9 Correct 75 ms 20308 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 780 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Incorrect 1 ms 852 KB Output isn't correct
20 Halted 0 ms 0 KB -