oj.uz

Submission #685414

# Submission time Handle Problem Language Result Execution time Memory
685414 2023-01-24T10:27:17 Z zeroesandones Bank (IZhO14_bank) C++17
100 / 100
 116 ms 16744 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define sp " "

#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb push_back

void solve()
{
    ll n, m;
    cin >> n >> m;

    ll a[n];
    FOR(i, 0, n)
        cin >> a[i];
    ll b[m];
    FOR(i, 0, m)
        cin >> b[i];

    ll paid[(1<<m)]; // no. of people in the prefix of a paid wih subset s
    ll left[(1<<m)]; // amount of money left if people in subset s were paid
                     
    memset(paid, -1, sizeof(paid));
    memset(left, -1, sizeof(left));

    paid[0] = 0;
    left[0] = 0;

    FOR(i, 1, (1<<m)) {
        FOR(j, 0, m) {
            if(!(i & (1<<j)))
                continue;
            ll prev = i ^ (1<<j);

            if(paid[prev] == -1) continue;

            ll val = left[prev] + b[j];
            ll tar = a[paid[prev]];

            if(val < tar) {
                paid[i] = paid[prev];
                left[i] = val;
            } else if(val == tar) {
                paid[i] = paid[prev] + 1;
                left[i] = 0;
            }
        }

        if(paid[i] == n) {
            cout << "YES" << nl;
            return;
        }
    }

    cout << "NO" << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 55 ms 16724 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 10 ms 16704 KB Output is correct
9 Correct 101 ms 16720 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 55 ms 16724 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 10 ms 16704 KB Output is correct
9 Correct 101 ms 16720 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 456 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 448 KB Output is correct
31 Correct 99 ms 16724 KB Output is correct
32 Correct 116 ms 16700 KB Output is correct
33 Correct 72 ms 16732 KB Output is correct
34 Correct 61 ms 16708 KB Output is correct
35 Correct 56 ms 16724 KB Output is correct
36 Correct 53 ms 16700 KB Output is correct
37 Correct 54 ms 16712 KB Output is correct
38 Correct 56 ms 16708 KB Output is correct
39 Correct 9 ms 16704 KB Output is correct
40 Correct 55 ms 16744 KB Output is correct
41 Correct 56 ms 16716 KB Output is correct
42 Correct 107 ms 16708 KB Output is correct
43 Correct 57 ms 16724 KB Output is correct
44 Correct 55 ms 16724 KB Output is correct
45 Correct 10 ms 16640 KB Output is correct
46 Correct 84 ms 16724 KB Output is correct
47 Correct 59 ms 16724 KB Output is correct
48 Correct 9 ms 16724 KB Output is correct
49 Correct 59 ms 16724 KB Output is correct
50 Correct 94 ms 16712 KB Output is correct
51 Correct 56 ms 16724 KB Output is correct
52 Correct 56 ms 16724 KB Output is correct
53 Correct 112 ms 16724 KB Output is correct
54 Correct 114 ms 16724 KB Output is correct
55 Correct 93 ms 16708 KB Output is correct
56 Correct 90 ms 16724 KB Output is correct
57 Correct 92 ms 16708 KB Output is correct
58 Correct 92 ms 16724 KB Output is correct