oj.uz

Submission #172968

# Submission time Handle Problem Language Result Execution time Memory
172968 2020-01-02T21:28:37 Z VEGAnn Bank (IZhO14_bank) C++14
100 / 100
 826 ms 22136 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define PB push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N = 20;
const int NN = (1 << N);
const int PW = 10;
const int oo = 2e9;
const int md = 998244353;
int pref[N], sum[NN], mm, a[N], b[N], n, m;
bool f[N][NN];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < m; i++)
        cin >> b[i];

    mm = (1 << m);
    for (int msk = 1; msk < mm; msk++){
        sum[msk] = 0;
        for (int j = 0; j < m; j++)
            if (msk & (1 << j))
                sum[msk] += b[j];
    }

    pref[0] = 0;
    for (int i = 1; i <= n; i++)
        pref[i] = pref[i - 1] + a[i - 1];

    f[0][0] = 1;
    for (int i = 0; i < n; i++)
    for (int msk = 0; msk < mm; msk++){
        if (!f[i][msk]) continue;

        if (i < n - 1 && sum[msk] == pref[i + 1])
            f[i + 1][msk] = 1;

        for (int j = 0; j < m; j++)
            if (!(msk & (1 << j)))
                f[i][msk ^ (1 << j)] = 1;
    }

    bool ok = 0;
    for (int msk = 0; msk < mm; msk++)
        if (f[n - 1][msk] && sum[msk] == pref[n]) {
            ok = 1;
            break;
        }

    cout << (ok ? "YES" : "NO");

    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 156 ms 5624 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 155 ms 5496 KB Output is correct
9 Correct 156 ms 5496 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 156 ms 5624 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 155 ms 5496 KB Output is correct
9 Correct 156 ms 5496 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 4 ms 504 KB Output is correct
22 Correct 5 ms 632 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 4 ms 504 KB Output is correct
26 Correct 4 ms 504 KB Output is correct
27 Correct 4 ms 504 KB Output is correct
28 Correct 5 ms 504 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 376 KB Output is correct
31 Correct 189 ms 6428 KB Output is correct
32 Correct 209 ms 7436 KB Output is correct
33 Correct 230 ms 9352 KB Output is correct
34 Correct 233 ms 9664 KB Output is correct
35 Correct 236 ms 10020 KB Output is correct
36 Correct 254 ms 7544 KB Output is correct
37 Correct 183 ms 6556 KB Output is correct
38 Correct 159 ms 5452 KB Output is correct
39 Correct 679 ms 12800 KB Output is correct
40 Correct 182 ms 8056 KB Output is correct
41 Correct 192 ms 5900 KB Output is correct
42 Correct 265 ms 9132 KB Output is correct
43 Correct 210 ms 8540 KB Output is correct
44 Correct 173 ms 5596 KB Output is correct
45 Correct 255 ms 7604 KB Output is correct
46 Correct 234 ms 8952 KB Output is correct
47 Correct 213 ms 7724 KB Output is correct
48 Correct 155 ms 5496 KB Output is correct
49 Correct 156 ms 5496 KB Output is correct
50 Correct 746 ms 22008 KB Output is correct
51 Correct 305 ms 10496 KB Output is correct
52 Correct 393 ms 10488 KB Output is correct
53 Correct 386 ms 13536 KB Output is correct
54 Correct 826 ms 21952 KB Output is correct
55 Correct 745 ms 22136 KB Output is correct
56 Correct 810 ms 22008 KB Output is correct
57 Correct 739 ms 20916 KB Output is correct
58 Correct 740 ms 20984 KB Output is correct