Submission #58102

#	Time	Username	Problem	Language	Result	Execution time	Memory
58102		Benq	Bank (IZhO14_bank)	C++14	100 / 100	178 ms	55140 KiB

bank

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

vi sum[1000001];
int N,M,A[20],B[20],bes[1<<20],co;

void finish() {
    vi cur = {(1<<M)-1};
    F0R(i,N) {
        vi CUR;
        for (int a: cur) for (int b: sum[A[i]]) if ((a&b) == b) CUR.pb(bes[a^b]);
        sort(all(CUR)); CUR.erase(unique(all(CUR)),CUR.end());
        cur = CUR;
    }
    if (sz(cur)) cout << "YES";
    else cout << "NO";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M;
    F0R(i,N) cin >> A[i];
    F0R(i,M) cin >> B[i];
    sort(B,B+M);
    
    vector<array<int,3>> cur; cur.pb({0,0,0}); // sum, val, VAL;
    for (int i = 0; i < M; ) {
        int I = i; while (i < M && B[i] == B[I]) i ++;
        vector<array<int,3>> CUR;
        F0R(j,1<<(i-I)) for (auto a: cur) {
            int t = __builtin_popcount(j);
            CUR.pb({a[0]+t*B[I],a[1]+(j<<I),a[2]+(((1<<t)-1)<<I)});
        }
        cur = CUR;
    }
    for (auto a: cur) {
        bes[a[1]] = a[2];
        if (a[1] == a[2]) {
            sum[a[0]].pb(a[1]);
            // cout << "HI " << a[1] << "\n";
        }
    }
    
    finish();
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

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