oj.uz

Submission #330398

# Submission time Handle Problem Language Result Execution time Memory
330398 2020-11-25T05:21:15 Z Vince729 Bank (IZhO14_bank) C++11
100 / 100
 492 ms 15596 KB 
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<complex>
using namespace std;

typedef long long ll;
typedef complex<double> pt;
#define x() real()
#define y() imag()
#define smx(a, b) a = max(a, b)
#define smn(a, b) a = min(a, b)
#define in(mp, v) mp.find(v) != mp.end()

const int MAXN = 20;
const int MOD = 1000000007;

int n, m, a[MAXN+1], b[MAXN];
bool work[MAXN+1][1<<MAXN];
vector<int> combs[MAXN+1];

int sum(int x) {
    int ret = 0, i = 0;
    for (; x; i++, x>>=1) ret += b[i]*(x&1);
    return ret;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int j = 0; j < m; j++) cin >> b[j];

    for (int k = 0; k < (1<<m); k++) {
        int sm = sum(k);
        for (int i = 1; i <= n; i++) {
            if (sm == a[i]) {
                combs[i].push_back(k);
            }
        }
    }

    work[0][0] = true;
    bool found;
    for (int i = 1; i <= n; i++) {
        found = false;
        for (int k = 0; k < (1<<m); k++) {
            if (work[i-1][k]) {
                for (int c : combs[i]) {
                    if ((k & c) == 0) {
                        work[i][k|c] = true;
                        found = true;
                    }
                }
            }
        }
        if (!found) break;
    }
    if (found) {
        cout << "YES" << endl;
    } else cout << "NO" << endl;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 25 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 27 ms 1388 KB Output is correct
9 Correct 25 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 25 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 27 ms 1388 KB Output is correct
9 Correct 25 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 30 ms 1132 KB Output is correct
32 Correct 117 ms 2668 KB Output is correct
33 Correct 37 ms 1772 KB Output is correct
34 Correct 43 ms 492 KB Output is correct
35 Correct 55 ms 492 KB Output is correct
36 Correct 60 ms 492 KB Output is correct
37 Correct 27 ms 364 KB Output is correct
38 Correct 30 ms 364 KB Output is correct
39 Correct 53 ms 5484 KB Output is correct
40 Correct 37 ms 364 KB Output is correct
41 Correct 48 ms 396 KB Output is correct
42 Correct 39 ms 3820 KB Output is correct
43 Correct 40 ms 1132 KB Output is correct
44 Correct 42 ms 364 KB Output is correct
45 Correct 32 ms 2796 KB Output is correct
46 Correct 37 ms 2304 KB Output is correct
47 Correct 58 ms 492 KB Output is correct
48 Correct 26 ms 1388 KB Output is correct
49 Correct 25 ms 364 KB Output is correct
50 Correct 149 ms 15596 KB Output is correct
51 Correct 43 ms 620 KB Output is correct
52 Correct 49 ms 3436 KB Output is correct
53 Correct 492 ms 8428 KB Output is correct
54 Correct 175 ms 15084 KB Output is correct
55 Correct 149 ms 15468 KB Output is correct
56 Correct 148 ms 15596 KB Output is correct
57 Correct 154 ms 14572 KB Output is correct
58 Correct 155 ms 14444 KB Output is correct