oj.uz

Submission #90687

# Submission time Handle Problem Language Result Execution time Memory
90687 2018-12-23T15:20:17 Z popovicirobert Bank (IZhO14_bank) C++14
100 / 100
 614 ms 764 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44

using namespace std;

vector <short> a, b;
short n, m;

void bkt1(short , vector <short> &);
int cnt = 0;

void bkt2(short pa, short pb, vector <short> &b, short sum, vector <short> &aux) {
    if(cnt > 40000000) {
        cout << "NO";
        exit(0);
    }
    if(pb == b.size()) {
        if(sum == a[pa]) {
            bkt1(pa + 1, aux);
        }
    }
    else {
        cnt++;
        bkt2(pa, pb + 1, b, sum + b[pb], aux);
        aux.push_back(b[pb]);
        cnt++;
        bkt2(pa, pb + 1, b, sum, aux);
        aux.pop_back();

    }
}

void bkt1(short pa, vector <short> &b) {
    if(pa == n) {
        cout << "YES";
        exit(0);
    }
    else {
        vector <short> aux;
        bkt2(pa, 0, b, 0, aux);
    }
}

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    short i;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    a.resize(n);
    b.resize(m);
    for(i = 0; i < n; i++) {
        cin >> a[i];
    }
    for(i = 0; i < m; i++) {
        cin >> b[i];
    }
    sort(b.begin(), b.end(), greater<int>());
    sort(a.begin(), a.end(), greater<int>());
    bkt1(0, b);
    cout << "NO";
    //cin.close();
    //cout.close();
    return 0;
}

Compilation message

bank.cpp: In function 'void bkt2(short int, short int, std::vector<short int>&, short int, std::vector<short int>&)':
bank.cpp:22:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(pb == b.size()) {
        ~~~^~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 12 ms 512 KB Output is correct
6 Correct 2 ms 660 KB Output is correct
7 Correct 2 ms 660 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 12 ms 660 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 372 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 12 ms 512 KB Output is correct
6 Correct 2 ms 660 KB Output is correct
7 Correct 2 ms 660 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 12 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 1 ms 660 KB Output is correct
13 Correct 2 ms 660 KB Output is correct
14 Correct 2 ms 660 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 660 KB Output is correct
17 Correct 2 ms 660 KB Output is correct
18 Correct 2 ms 660 KB Output is correct
19 Correct 10 ms 660 KB Output is correct
20 Correct 2 ms 660 KB Output is correct
21 Correct 2 ms 660 KB Output is correct
22 Correct 2 ms 660 KB Output is correct
23 Correct 5 ms 660 KB Output is correct
24 Correct 2 ms 660 KB Output is correct
25 Correct 2 ms 660 KB Output is correct
26 Correct 2 ms 660 KB Output is correct
27 Correct 2 ms 660 KB Output is correct
28 Correct 2 ms 660 KB Output is correct
29 Correct 2 ms 660 KB Output is correct
30 Correct 2 ms 660 KB Output is correct
31 Correct 4 ms 660 KB Output is correct
32 Correct 5 ms 660 KB Output is correct
33 Correct 16 ms 660 KB Output is correct
34 Correct 14 ms 660 KB Output is correct
35 Correct 27 ms 660 KB Output is correct
36 Correct 12 ms 660 KB Output is correct
37 Correct 17 ms 660 KB Output is correct
38 Correct 14 ms 660 KB Output is correct
39 Correct 12 ms 660 KB Output is correct
40 Correct 25 ms 660 KB Output is correct
41 Correct 19 ms 660 KB Output is correct
42 Correct 207 ms 764 KB Output is correct
43 Correct 53 ms 764 KB Output is correct
44 Correct 21 ms 764 KB Output is correct
45 Correct 7 ms 764 KB Output is correct
46 Correct 8 ms 764 KB Output is correct
47 Correct 19 ms 764 KB Output is correct
48 Correct 3 ms 764 KB Output is correct
49 Correct 12 ms 764 KB Output is correct
50 Correct 12 ms 764 KB Output is correct
51 Correct 9 ms 764 KB Output is correct
52 Correct 9 ms 764 KB Output is correct
53 Correct 8 ms 764 KB Output is correct
54 Correct 12 ms 764 KB Output is correct
55 Correct 13 ms 764 KB Output is correct
56 Correct 12 ms 764 KB Output is correct
57 Correct 614 ms 764 KB Output is correct
58 Correct 11 ms 764 KB Output is correct