oj.uz

Submission #969228

# Submission time Handle Problem Language Result Execution time Memory
969228 2024-04-24T17:25:09 Z biank Bank (IZhO14_bank) C++14
19 / 100
 9 ms 10820 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 20;
const int MAX_S = 1001;

int sum[1 << MAX_N];
bool vis[1 << MAX_N];
vector<int> adj[MAX_S];
int a[MAX_N], b[MAX_N], n;

bool dfs(int i, int u) {
    if (i == n) return true;
    vis[u] = true;
    for (int v : adj[a[i]]) {
        if ((u & v) == v && !vis[v] && dfs(i + 1, u ^ v)) return true;
    }
    return false;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int 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 = 1; mask < 1 << m; mask++) {
        if (mask != 0) {
            int i = __builtin_ctz(mask);
            sum[mask] = sum[mask ^ (1 << i)] + b[i];
        }
        if (sum[mask] < MAX_S) {
            adj[sum[mask]].push_back(mask);
        }
    }
    if (dfs(0, (1 << m) - 1)) cout << "YES\n";
    else cout << "NO\n";
    
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 9 ms 10820 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 10076 KB Output is correct
9 Correct 7 ms 10588 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 9 ms 10820 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 10076 KB Output is correct
9 Correct 7 ms 10588 KB Output is correct
10 Incorrect 1 ms 344 KB Output isn't correct
11 Halted 0 ms 0 KB -