oj.uz

Submission #802950

# Submission time Handle Problem Language Result Execution time Memory
802950 2023-08-02T16:20:31 Z VMaksimoski008 Bank (IZhO14_bank) C++14
100 / 100
 115 ms 16772 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
#define each(x, v) for(auto &x : v)
#define mp make_pair

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int32_t main() {
    setIO();

    int n, m;
    cin >> n >> m;

    vector<int> need(n), money(m);
    for(int &x : need) cin >> x;
    for(int &x : money) cin >> x;

    vector<ll> done(1<<m, -1);
    vector<ll> left(1<<m, -1);
    done[0] = 0, left[0] = 0;

    for(int s=1; s<(1<<m); s++) {
        for(int i=0; i<m; i++) {
            if((s & (1 << i)) && done[s^(1<<i)] >= 0) {
                int total = left[s^(1<<i)] + money[i];
                int want = need[done[s^(1<<i)]];

                if(total == want) {
                    done[s] = 1 + done[s^(1<<i)];
                    left[s] = 0;
                } else if(total < want) {
                    done[s] = done[s^(1<<i)];
                    left[s] = total;
                }
            }
        }
    }

    // for(int s=0; s<(1<<m); s++) {
    //     string x = bitset<6>(s).to_string();
    //     reverse(all(x));
    //     cout << x << ": ";
    //     cout << done[s] << " " << left[s] << '\n';
    // }

    for(int s=1; s<(1<<m); s++) {
        if(done[s] == n) {
            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 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 3 ms 724 KB Output is correct
5 Correct 84 ms 16724 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 87 ms 16732 KB Output is correct
9 Correct 91 ms 16732 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 3 ms 724 KB Output is correct
5 Correct 84 ms 16724 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 87 ms 16732 KB Output is correct
9 Correct 91 ms 16732 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 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 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 2 ms 580 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 96 ms 16736 KB Output is correct
32 Correct 100 ms 16736 KB Output is correct
33 Correct 84 ms 16736 KB Output is correct
34 Correct 88 ms 16736 KB Output is correct
35 Correct 76 ms 16732 KB Output is correct
36 Correct 78 ms 16772 KB Output is correct
37 Correct 75 ms 16724 KB Output is correct
38 Correct 75 ms 16736 KB Output is correct
39 Correct 92 ms 16732 KB Output is correct
40 Correct 75 ms 16724 KB Output is correct
41 Correct 80 ms 16724 KB Output is correct
42 Correct 108 ms 16724 KB Output is correct
43 Correct 75 ms 16704 KB Output is correct
44 Correct 77 ms 16736 KB Output is correct
45 Correct 115 ms 16736 KB Output is correct
46 Correct 92 ms 16736 KB Output is correct
47 Correct 88 ms 16732 KB Output is correct
48 Correct 82 ms 16732 KB Output is correct
49 Correct 75 ms 16724 KB Output is correct
50 Correct 81 ms 16732 KB Output is correct
51 Correct 77 ms 16732 KB Output is correct
52 Correct 76 ms 16724 KB Output is correct
53 Correct 97 ms 16732 KB Output is correct
54 Correct 93 ms 16736 KB Output is correct
55 Correct 97 ms 16680 KB Output is correct
56 Correct 82 ms 16724 KB Output is correct
57 Correct 90 ms 16736 KB Output is correct
58 Correct 82 ms 16724 KB Output is correct