oj.uz

Submission #548891

# Submission time Handle Problem Language Result Execution time Memory
548891 2022-04-14T15:57:53 Z Blossomstream Bank (IZhO14_bank) C++14
71 / 100
 397 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m;
int a[1000];
int b[1000];
vector<int> d1[1024];
vector<int> d2[1024];
ll sum[1<<20];
int main() {
    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 i = 0; i < (1<<m); i++) {
        for(int j = 0; (1<<j) <= i; j++) {
            if((i & (1<<j)) != 0) sum[i] += (ll) b[j];
        }
    }
    int x = (n + 1)/2;
    int y = n/2;
    for(int i = 0; i < x; i++) {
        for(int j = 0; j < (1<<m); j++) {
            if(sum[j] == (ll) a[i]) d1[1<<i].push_back(j);
        }
    }
    d1[0].push_back(0);
    for(int i = 1; i < (1<<x); i++) {
        for(int j = 0; (1<<j) <= i; j++) {
            if(i == (1<<j)) continue;
            if((i & (1<<j)) != 0) {
                for(int l: d1[1<<j]) {
                    for(int k: d1[i - (1<<j)]) {
                        if((l & k) == 0) d1[i].push_back(l + k);
                    }
                }
            }
        }
    }
    for(int i = 0; i < y; i++) {
        for(int j = 0; j < (1<<m); j++) {
            if(sum[j] == (ll) a[i + x]) d2[1<<i].push_back(j);
        }
    }
    d2[0].push_back(0);
    for(int i = 1; i < (1<<y); i++) {
        for(int j = 0; (1<<j) <= i; j++) {
            if(i == (1<<j)) continue;
            if((i & (1<<j)) != 0) {
                for(int l: d2[1<<j]) {
                    for(int k: d2[i - (1<<j)]) {
                        if((l & k) == 0) d2[i].push_back(l + k);
                    }
                }
            }
        }
    }
    for(int i: d1[(1<<x) - 1]) {
        for(int j: d2[(1<<y) - 1]) {
            if((i & j) == 0) {
                cout << "YES";
                return 0;
            }
        }
    }
    cout << "NO";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 68 ms 8544 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 69 ms 8528 KB Output is correct
9 Correct 75 ms 8488 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 68 ms 8544 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 69 ms 8528 KB Output is correct
9 Correct 75 ms 8488 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 7 ms 3680 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 76 ms 8540 KB Output is correct
32 Correct 126 ms 12840 KB Output is correct
33 Correct 90 ms 8536 KB Output is correct
34 Correct 91 ms 8536 KB Output is correct
35 Correct 94 ms 8504 KB Output is correct
36 Runtime error 397 ms 262144 KB Execution killed with signal 9
37 Halted 0 ms 0 KB -