oj.uz

Submission #661274

# Submission time Handle Problem Language Result Execution time Memory
661274 2022-11-25T07:13:23 Z hafo Bank (IZhO14_bank) C++17
19 / 100
 38 ms 8504 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];
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];

    for(int mask = 0; mask < (1 << m); mask++) dp[mask] = {-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], add = (s == a[i]);
                dp[mask ^ (1 << j)] = make_pair(i + add, add == 0 ? s:0);
                if(i + add == n) {
                    cout<<"YES";
                    exit(0);
                }
            }
    cout<<"NO";
    return 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 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 38 ms 8504 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 35 ms 8504 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
0 / 27.0

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

Subtask #4
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 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 38 ms 8504 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 35 ms 8504 KB Output is correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -