Submission #658255

#	Time	Username	Problem	Language	Result	Execution time	Memory
658255		ssense	Bank (IZhO14_bank)	C++14	100 / 100	114 ms	16744 KiB

bank

#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r+1]-pref[l];}};//mesanu

void solve()
{
    int n, m;
    cin >> n >> m;
    vint a = read(n);
    vint b = read(m);
    vector<int> umpluti(1<<m, -1);
    vector<int> ramas(1<<m, -1);
    ramas[0] = 0;
    umpluti[0] = 0;
    for(int acum = 0; acum < 1<<m; acum++)
    {
        for(int ult = 0; ult < m; ult++)
        {
            if((acum&(1<<ult)) == 0)
            {
                continue;
            }
            int inainte = acum & (~(1<<ult));
            if(umpluti[inainte] == -1)
            {
                continue;
            }
            int acum_ramas = ramas[inainte]+b[ult];
            int trebuie_de_umplut = a[umpluti[inainte]];
            if(acum_ramas < trebuie_de_umplut)
            {
                umpluti[acum] = umpluti[inainte];
                ramas[acum] = acum_ramas;
            }
            else if(acum_ramas == trebuie_de_umplut)
            {
                umpluti[acum] = umpluti[inainte]+1;
                ramas[acum] = 0;
            }
        }
        if(umpluti[acum] == n)
        {
            YES;
            return;
        }
    }
    NO;
}

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


/*
1 5
8
4 2 5 1 3
 */

Compilation message (stderr)

bank.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
bank.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r+1]-pref[l];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29