Submission #58100

#	Time	Username	Problem	Language	Result	Execution time	Memory
58100		Benq	Bank (IZhO14_bank)	C++14	71 / 100	1094 ms	110780 KiB

bank

#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];

void search(int nex, int csum, int val) {
    if (nex == M) {
        sum[csum].pb(val);
        return;
    }
    search(nex+1,csum,val);
    search(nex+1,csum+B[nex],val^(1<<nex));
}

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];
    search(0,0,0);
    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(a^b);
        sort(all(CUR)); CUR.erase(unique(all(CUR)),CUR.end());
        cur = CUR;
    }
    if (sz(cur)) cout << "YES";
    else cout << "NO";
}

/* 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: 0 / 29