oj.uz

Submission #969715

# Submission time Handle Problem Language Result Execution time Memory
969715 2024-04-25T13:35:06 Z Esgeer Bank (IZhO14_bank) C++17
100 / 100
 187 ms 772 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
#endif
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vpi vector<pii>
#define vvpi vector<vpi>
#define vb vector<bool>
#define vvb vector<vb>
#define endl '\n'
#define sp << " " <<
#define F(i, s, n) for(int i = s; i < (int) n; i++)
#define pb push_back
#define fi first
#define se second

int mod = 1e9;
int inf = 1e16;
const int N = 3e5+5;

void solve() {
    int n, m;
    cin >> n >> m;
    vi a(n), b(m);
    F(i, 0, n) cin >> a[i];
    F(i, 0, m) cin >> b[i];

    vb dp(1<<m, 0);
    dp[0] = 1;
    F(mask, 0, 1<<m) {
        if(!dp[mask]) continue;
        int paidSoFar = 0;
        F(i, 0, m) {
            if(mask >> i & 1) paidSoFar += b[i];
        }
        int nextPerson = 0;
        while(nextPerson < n && paidSoFar >= a[nextPerson]) paidSoFar -= a[nextPerson++];
        if(nextPerson == n) continue;
        int gap = a[nextPerson] - paidSoFar;
        F(i, 0, m) {
            if(mask >> i & 1) continue;
            if(b[i] <= gap) {
                dp[mask | (1 << i)] = 1;
            }
        }
    }
    int toBePaid = 0;
    F(i, 0, n) toBePaid += a[i];
    F(i, 0, 1 << m) {
        if(!dp[i]) continue;
        int paidSoFar = 0;
        F(j, 0, m) {
            if(i >> j & 1) paidSoFar += b[j];
        }
        if(paidSoFar == toBePaid) {
            cout << "YES" << endl;
            exit(0);
        }
    }
    cout << "NO" << endl;
}

void setIO() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef Local
        freopen("local.in", "r", stdin);
        freopen("local.out", "w", stdout);
    #else 
        // freopen("friendcross.in","r",stdin);
        // freopen("friendcross.out","w",stdout);
    #endif
}

signed main() {
    setIO();
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

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 0 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 52 ms 596 KB Output is correct
9 Correct 184 ms 476 KB Output is correct

Subtask #2
25.0 / 25.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 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 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 1 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 344 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 0 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 52 ms 596 KB Output is correct
9 Correct 184 ms 476 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 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 1 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 452 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 456 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 3 ms 344 KB Output is correct
31 Correct 141 ms 600 KB Output is correct
32 Correct 165 ms 772 KB Output is correct
33 Correct 13 ms 600 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 20 ms 596 KB Output is correct
40 Correct 2 ms 348 KB Output is correct
41 Correct 2 ms 472 KB Output is correct
42 Correct 84 ms 348 KB Output is correct
43 Correct 5 ms 348 KB Output is correct
44 Correct 3 ms 348 KB Output is correct
45 Correct 56 ms 572 KB Output is correct
46 Correct 35 ms 348 KB Output is correct
47 Correct 2 ms 348 KB Output is correct
48 Correct 24 ms 344 KB Output is correct
49 Correct 3 ms 348 KB Output is correct
50 Correct 182 ms 572 KB Output is correct
51 Correct 5 ms 348 KB Output is correct
52 Correct 9 ms 604 KB Output is correct
53 Correct 175 ms 576 KB Output is correct
54 Correct 178 ms 600 KB Output is correct
55 Correct 182 ms 576 KB Output is correct
56 Correct 179 ms 576 KB Output is correct
57 Correct 187 ms 444 KB Output is correct
58 Correct 183 ms 572 KB Output is correct