oj.uz

Submission #969708

# Submission time Handle Problem Language Result Execution time Memory
969708 2024-04-25T13:31:41 Z Esgeer Bank (IZhO14_bank) C++17
19 / 100
 173 ms 348 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 344 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 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 55 ms 348 KB Output is correct
9 Correct 173 ms 344 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 55 ms 348 KB Output is correct
9 Correct 173 ms 344 KB Output is correct
10 Incorrect 1 ms 344 KB Output isn't correct
11 Halted 0 ms 0 KB -