oj.uz

Submission #431870

# Submission time Handle Problem Language Result Execution time Memory
431870 2021-06-17T16:29:30 Z Aldas25 Bank (IZhO14_bank) C++14
100 / 100
 183 ms 1368 KB 
#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<piii> viii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 500100, MAXK = 60;
//const ll MOD = 998244353;
const ll MOD = 1e9+7;
const ll INF = 1e17;

int n, m;
int a[MAXN], b[MAXN];
ll pref[MAXN];
bool dp[1<<22];

int main()
{
    FAST_IO;

    cin >> n >> m;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 0, m-1) cin >> b[i];
    FOR(i, 1, n) pref[i] = pref[i-1] + a[i];

    ll sumA = 0, sumB = 0;
    FOR(i, 1, n) sumA += a[i];
    FOR(i, 0, m-1) sumB += b[i];
    if (sumB < sumA) {
        cout << "NO\n";
        return 0;
    }

    dp[0] = true;
    FOR(mask, 1, (1<<m)-1) {
        int sum = 0;
        FOR(i, 0, m-1) if (mask & (1<<i)) sum += b[i];
        if (sum > pref[n]) continue;

        int le = 0, ri = n;
        while (le < ri) {
            int mid = (le+ri)/2;
            if (pref[mid] >= sum) ri = mid;
            else le = mid+1;
        }
        int id = le;

        FOR(i, 0, m-1) {
            if (! (mask & (1<<i))) continue;
            int prevSum = sum - b[i];
            if (prevSum < pref[id-1]) continue;
            if (dp[mask ^ (1<<i)]) dp[mask] = true;
        }

        if (sum == pref[n] && dp[mask]) {
            cout << "YES\n";
            return 0;
        }
    }

    cout << "NO\n";

    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 63 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 129 ms 1304 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 63 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 129 ms 1304 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 3 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 3 ms 332 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 152 ms 1284 KB Output is correct
32 Correct 154 ms 1236 KB Output is correct
33 Correct 168 ms 1352 KB Output is correct
34 Correct 166 ms 848 KB Output is correct
35 Correct 167 ms 964 KB Output is correct
36 Correct 173 ms 456 KB Output is correct
37 Correct 66 ms 580 KB Output is correct
38 Correct 64 ms 352 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 122 ms 488 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 183 ms 1284 KB Output is correct
43 Correct 166 ms 1204 KB Output is correct
44 Correct 162 ms 332 KB Output is correct
45 Correct 2 ms 332 KB Output is correct
46 Correct 168 ms 1316 KB Output is correct
47 Correct 159 ms 456 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 63 ms 332 KB Output is correct
50 Correct 145 ms 1284 KB Output is correct
51 Correct 142 ms 452 KB Output is correct
52 Correct 156 ms 1352 KB Output is correct
53 Correct 150 ms 1344 KB Output is correct
54 Correct 149 ms 1348 KB Output is correct
55 Correct 147 ms 1368 KB Output is correct
56 Correct 146 ms 1236 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 143 ms 1360 KB Output is correct