oj.uz

Submission #914610

# Submission time Handle Problem Language Result Execution time Memory
914610 2024-01-22T11:47:29 Z DAleksa Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 3552 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    int a[n], b[m];
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];
    vector<int> masks[n];
    for(int mask = 0; mask < (1 << m); mask++) {
        int sum = 0;
        for(int j = 0; j < m; j++) if((1 << j) & mask) sum += b[j];
        for(int i = 0; i < n; i++) if(sum == a[i]) masks[i].push_back(mask);
    }
    bool dp[n][1 << m];
    for(int i = 0; i < n; i++) for(int j = 0; j < (1 << m); j++) dp[i][j] = false;
    for(int i : masks[0]) dp[0][i] = true;
    for(int i = 1; i < n; i++) {
        for(int mask = 0; mask < (1 << m); mask++) {
            for(int mask2 : masks[i]) {
                if((mask | mask2) == mask && dp[i - 1][mask ^ mask2]) {
                    dp[i][mask] = true;
                }
            }
        }
    }
    for(int i = 0; i < (1 << m); i++) {
        if(dp[n - 1][i]) {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 49 ms 1364 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 49 ms 1360 KB Output is correct
9 Correct 49 ms 1364 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 452 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 3 ms 456 KB Output is correct
5 Correct 2 ms 756 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2 ms 604 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 49 ms 1364 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 49 ms 1360 KB Output is correct
9 Correct 49 ms 1364 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 452 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 456 KB Output is correct
23 Correct 3 ms 456 KB Output is correct
24 Correct 2 ms 756 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 826 ms 2508 KB Output is correct
32 Execution timed out 1064 ms 3552 KB Time limit exceeded
33 Halted 0 ms 0 KB -