Submission #961886

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
961886	2024-04-12T16:43:46 Z	seriouslyFlawed	Bank (IZhO14_bank)	C++17	100 / 100	105 ms	8792 KB

bank

//#pragma GCC optimize("03,unroll-loops")

#include <bits/stdc++.h>

using namespace std;

// Shortcuts for common operations
#define pb push_back
#define p push
#define ppb pop_back
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define ll long long
//#define int ll
#define endl "\n"
#define sz(x) (int)x.size()

// Type definitions for convenience
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<pii> vii;

// Debugging macros
#define debug(x) cerr << #x << " = " << (x) << '\n'
#define debug_vector(v) _debug_vector(#v, v)
template<typename T>
void _debug_vector(const string& name, const vector<T>& a) {
    cerr << name << " = [ ";
    for(const auto &x : a) cerr << x << ' ';
    cerr << "]\n";
}

// I/O redirection for local testing
#define iofile(io) \
        freopen((io + ".in").c_str(), "r", stdin); \
        freopen((io + ".out").c_str(), "w", stdout);

// delta for floodfill
vi dx = {0, 1, 0, -1};
vi dy = {1, 0, -1, 0};

// extended deltas for floodfill
vi edx = {0, 1, 0, -1, 1, 1, -1, -1};
vi edy = {1, 0, -1, 0, 1, -1, 1, -1};

// Common outputs
void yes() { cout << "YES" << '\n'; }
void no() { cout << "NO" << '\n'; }


void fx() {
    int n, m;
    cin >> n >> m;
    vi people(n), notes(m);
    for(auto &i: people) cin >> i;
    for(auto &i: notes) cin >> i;

    vi dp(1 << m, -1), leftover(1 << m, -1);
    
    dp[0] = 0;
    leftover[0] = 0;

    for(int mask = 1; mask < (1 << m); mask++){
        for(int last = 0; last < m; last++){
            int prev = mask ^ (1 << last);

            if((mask & (1 << last)) == 0) continue;
            if(dp[prev] == -1) continue;

            int rem = leftover[prev] + notes[last];

            if(rem < people[dp[prev]]){
                dp[mask] = dp[prev];
                leftover[mask] = rem;
            }else if(rem == people[dp[prev]]){
                dp[mask] = dp[prev] +1;
                leftover[mask] = 0;
            }
        }

        if(dp[mask] == n){
            yes();
            return;
        }
    }

    no();
}

signed main() {

    cin.tie(0)->sync_with_stdio(0);
    // Uncomment the following lines for file I/O
    // iofile(string("hello"));
    
    // Uncomment the following lines for multiple test cases
    // int t; cin >> t; while(t--) fx();
    
    // Single test case
    fx();
    
    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	0 ms	348 KB	Output is correct
3	Correct	1 ms	456 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	68 ms	8540 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	3 ms	8540 KB	Output is correct
9	Correct	79 ms	8656 KB	Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 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	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	452 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	0 ms	348 KB	Output is correct
3	Correct	1 ms	456 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	68 ms	8540 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	3 ms	8540 KB	Output is correct
9	Correct	79 ms	8656 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	456 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	2 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	1 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	2 ms	344 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	452 KB	Output is correct
31	Correct	89 ms	8648 KB	Output is correct
32	Correct	92 ms	8660 KB	Output is correct
33	Correct	74 ms	8540 KB	Output is correct
34	Correct	69 ms	8540 KB	Output is correct
35	Correct	68 ms	8540 KB	Output is correct
36	Correct	68 ms	8536 KB	Output is correct
37	Correct	68 ms	8540 KB	Output is correct
38	Correct	68 ms	8656 KB	Output is correct
39	Correct	2 ms	8540 KB	Output is correct
40	Correct	68 ms	8540 KB	Output is correct
41	Correct	74 ms	8540 KB	Output is correct
42	Correct	105 ms	8664 KB	Output is correct
43	Correct	71 ms	8784 KB	Output is correct
44	Correct	68 ms	8660 KB	Output is correct
45	Correct	3 ms	8540 KB	Output is correct
46	Correct	84 ms	8792 KB	Output is correct
47	Correct	68 ms	8540 KB	Output is correct
48	Correct	2 ms	8536 KB	Output is correct
49	Correct	72 ms	8660 KB	Output is correct
50	Correct	79 ms	8660 KB	Output is correct
51	Correct	69 ms	8656 KB	Output is correct
52	Correct	68 ms	8656 KB	Output is correct
53	Correct	90 ms	8540 KB	Output is correct
54	Correct	91 ms	8660 KB	Output is correct
55	Correct	79 ms	8664 KB	Output is correct
56	Correct	80 ms	8656 KB	Output is correct
57	Correct	84 ms	8664 KB	Output is correct
58	Correct	79 ms	8540 KB	Output is correct

Submission #961886

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #1
19.0 / 19.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0