oj.uz

Submission #37466

# Submission time Handle Problem Language Result Execution time Memory
37466 2017-12-25T15:48:54 Z nickyrio Bank (IZhO14_bank) C++14
100 / 100
 393 ms 13744 KB 
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i<= b; ++i)
#define FORD(i, a, b) for (int i = a; i>=b; --i)
#define REP(i, a) for (int i = 0; i<a; ++i)
#define DEBUG(x) { cerr << #x << " = " << x << endl; }
#define Arr(A, l, r) { cerr << #A  << " = "; FOR(_, l, r) cerr << A[_] << ' '; cerr << endl; }
#define N 21
#define pp pair<int, int>
#define next __next
#define prev __prev
#define __builtin_popcount __builtin_popcountll
#define bit(S, i) (((S) >> i) & 1)
#define IO ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define taskname "Test"
using namespace std;

int n, m, a[N], b[N], dp[1 << N];
vector<int> have[N];

template<class X, class Y> inline void Max(X &x, Y y) { x = x > y ? x : y; }

void cal(int mask, int level) {
    if (level == -1) {
        return;
    }
    cal(mask, level - 1);
    cal(mask + (1 << level), level - 1);
    REP(S, 1 << level) {
        Max(dp[S + mask + (1 << level)], dp[S + mask]);
    }
}
int main() {

 //   freopen(taskname".inp","r",stdin);
 //   freopen(taskname".out","w",stdout);
    IO;
    cin >> n >> m;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 2, n) a[i] += a[i - 1];
    REP(i, m) cin >> b[i];
    REP(S, 1 << m) {
        int total = 0;
        REP(i, m) if (bit(S, i)) total += b[i];
        FOR(i, 1, n) if (total == a[i]) {
            have[i].push_back(S);
        }
    }
    memset(dp, 0, sizeof dp);
    FOR(i, 1, n) {
        cal(0, m - 1);
        for (int mask : have[i]) {
            //cout << i << ' ' <<  mask << ' ' << dp[mask] << endl;
            if (dp[mask] == i - 1) {
                dp[mask] = i;
            }
        }
    }
    REP(S, 1 << m) {
        if (dp[S] == n) {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8568 KB Output is correct
2 Correct 7 ms 8648 KB Output is correct
3 Correct 7 ms 8648 KB Output is correct
4 Correct 9 ms 8648 KB Output is correct
5 Correct 85 ms 8660 KB Output is correct
6 Correct 9 ms 8660 KB Output is correct
7 Correct 8 ms 8736 KB Output is correct
8 Correct 85 ms 8736 KB Output is correct
9 Correct 90 ms 8752 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8752 KB Output is correct
2 Correct 7 ms 8756 KB Output is correct
3 Correct 8 ms 8780 KB Output is correct
4 Correct 7 ms 8808 KB Output is correct
5 Correct 7 ms 8816 KB Output is correct
6 Correct 7 ms 8940 KB Output is correct
7 Correct 7 ms 8940 KB Output is correct
8 Correct 7 ms 8940 KB Output is correct
9 Correct 7 ms 8940 KB Output is correct
10 Correct 7 ms 8940 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8568 KB Output is correct
2 Correct 7 ms 8648 KB Output is correct
3 Correct 7 ms 8648 KB Output is correct
4 Correct 9 ms 8648 KB Output is correct
5 Correct 85 ms 8660 KB Output is correct
6 Correct 9 ms 8660 KB Output is correct
7 Correct 8 ms 8736 KB Output is correct
8 Correct 85 ms 8736 KB Output is correct
9 Correct 90 ms 8752 KB Output is correct
10 Correct 7 ms 8752 KB Output is correct
11 Correct 7 ms 8756 KB Output is correct
12 Correct 8 ms 8780 KB Output is correct
13 Correct 7 ms 8808 KB Output is correct
14 Correct 7 ms 8816 KB Output is correct
15 Correct 7 ms 8940 KB Output is correct
16 Correct 7 ms 8940 KB Output is correct
17 Correct 7 ms 8940 KB Output is correct
18 Correct 7 ms 8940 KB Output is correct
19 Correct 7 ms 8940 KB Output is correct
20 Correct 9 ms 8940 KB Output is correct
21 Correct 8 ms 8940 KB Output is correct
22 Correct 10 ms 8940 KB Output is correct
23 Correct 12 ms 8940 KB Output is correct
24 Correct 11 ms 8940 KB Output is correct
25 Correct 10 ms 8940 KB Output is correct
26 Correct 10 ms 8940 KB Output is correct
27 Correct 10 ms 8940 KB Output is correct
28 Correct 10 ms 8940 KB Output is correct
29 Correct 11 ms 8940 KB Output is correct
30 Correct 12 ms 8940 KB Output is correct
31 Correct 105 ms 8940 KB Output is correct
32 Correct 121 ms 8964 KB Output is correct
33 Correct 191 ms 8964 KB Output is correct
34 Correct 225 ms 8964 KB Output is correct
35 Correct 240 ms 8964 KB Output is correct
36 Correct 393 ms 8964 KB Output is correct
37 Correct 105 ms 8964 KB Output is correct
38 Correct 135 ms 8964 KB Output is correct
39 Correct 196 ms 9964 KB Output is correct
40 Correct 233 ms 9964 KB Output is correct
41 Correct 381 ms 9964 KB Output is correct
42 Correct 153 ms 9964 KB Output is correct
43 Correct 196 ms 9964 KB Output is correct
44 Correct 300 ms 9964 KB Output is correct
45 Correct 120 ms 9964 KB Output is correct
46 Correct 166 ms 9964 KB Output is correct
47 Correct 298 ms 9964 KB Output is correct
48 Correct 89 ms 9964 KB Output is correct
49 Correct 88 ms 9964 KB Output is correct
50 Correct 388 ms 13212 KB Output is correct
51 Correct 223 ms 13212 KB Output is correct
52 Correct 225 ms 13212 KB Output is correct
53 Correct 231 ms 13212 KB Output is correct
54 Correct 391 ms 13212 KB Output is correct
55 Correct 388 ms 13232 KB Output is correct
56 Correct 392 ms 13744 KB Output is correct
57 Correct 384 ms 13744 KB Output is correct
58 Correct 378 ms 13744 KB Output is correct