oj.uz

Submission #947438

# Submission time Handle Problem Language Result Execution time Memory
947438 2024-03-16T07:21:58 Z Pring Bank (IZhO14_bank) C++17
100 / 100
 477 ms 856 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 25;
int n, m, a[MXN], c[MXN];
int p[MXN];
bitset<1050000> dp;

int sum_of(int *a, int *b) {
    int ans = 0;
    while (a != b) {
        ans += *a;
        a++;
    }
    return ans;
}

int sum(int I) {
    int ans = 0;
    FOR(i, 0, m) if (I & (1 << i)) {
        ans += c[i];
    }
    return ans;
}

int cv(int I) {
    return upper_bound(p, p + n, sum(I)) - p - 1;
}

bool DP(int I) {
    FOR(i, 0, m) if (I & (1 << i)) {
        int I_ = I ^ (1 << i);
        if (!dp[I_]) continue;
        int x = cv(I_), y = cv(I);
        if (x + 1 < y) continue;
        if (x == y) return true;
        if (p[y] == sum(I)) return true;
    }
    return false;
}

bool miku() {
    cin >> n >> m;
    FOR(i, 0, n) cin >> a[i];
    FOR(i, 0, m) cin >> c[i];
    if (sum_of(a, a + n) > sum_of(c, c + m)) return false;
    FOR(i, 0, n) p[i + 1] = p[i] + a[i];
    if (sum_of(a, a + n) != sum_of(c, c + m)) {
        p[n + 1] = sum_of(c, c + m);
        n = n + 2;
    } else {
        n = n + 1;
    }
    dp[0] = true;
    FOR(I, 1, (1 << m)) dp[I] = DP(I);
    // FOR(i, 0, (1 << m)) cout << dp[i] << ' ';
    // cout << endl;
    return dp[(1 << m) - 1];
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    cout << (miku() ? "YES" : "NO") << '\n';
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 6 ms 456 KB Output is correct
5 Correct 95 ms 472 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 308 ms 552 KB Output is correct
9 Correct 137 ms 464 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 6 ms 456 KB Output is correct
5 Correct 95 ms 472 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 308 ms 552 KB Output is correct
9 Correct 137 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 392 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 3 ms 344 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 204 ms 472 KB Output is correct
32 Correct 169 ms 348 KB Output is correct
33 Correct 149 ms 740 KB Output is correct
34 Correct 84 ms 348 KB Output is correct
35 Correct 87 ms 600 KB Output is correct
36 Correct 81 ms 348 KB Output is correct
37 Correct 83 ms 472 KB Output is correct
38 Correct 82 ms 348 KB Output is correct
39 Correct 145 ms 456 KB Output is correct
40 Correct 82 ms 560 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 305 ms 748 KB Output is correct
43 Correct 102 ms 348 KB Output is correct
44 Correct 84 ms 344 KB Output is correct
45 Correct 347 ms 348 KB Output is correct
46 Correct 243 ms 604 KB Output is correct
47 Correct 84 ms 560 KB Output is correct
48 Correct 244 ms 344 KB Output is correct
49 Correct 85 ms 736 KB Output is correct
50 Correct 477 ms 560 KB Output is correct
51 Correct 99 ms 348 KB Output is correct
52 Correct 117 ms 508 KB Output is correct
53 Correct 357 ms 532 KB Output is correct
54 Correct 433 ms 344 KB Output is correct
55 Correct 474 ms 344 KB Output is correct
56 Correct 403 ms 856 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 387 ms 460 KB Output is correct