Submission #58102

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
58102	2018-07-16T20:21:48 Z	Benq	Bank (IZhO14_bank)	C++14	100 / 100	178 ms	55140 KB

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.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	23800 KB	Output is correct
2	Correct	23 ms	23932 KB	Output is correct
3	Correct	20 ms	23992 KB	Output is correct
4	Correct	26 ms	25004 KB	Output is correct
5	Correct	107 ms	54844 KB	Output is correct
6	Correct	23 ms	54844 KB	Output is correct
7	Correct	24 ms	54844 KB	Output is correct
8	Correct	105 ms	54912 KB	Output is correct
9	Correct	94 ms	54920 KB	Output is correct

Subtask #2
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	54920 KB	Output is correct
2	Correct	23 ms	54920 KB	Output is correct
3	Correct	22 ms	54920 KB	Output is correct
4	Correct	20 ms	54920 KB	Output is correct
5	Correct	21 ms	54920 KB	Output is correct
6	Correct	24 ms	54920 KB	Output is correct
7	Correct	24 ms	54920 KB	Output is correct
8	Correct	23 ms	54920 KB	Output is correct
9	Correct	24 ms	54920 KB	Output is correct
10	Correct	24 ms	54920 KB	Output is correct

Subtask #3
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	54920 KB	Output is correct
2	Correct	25 ms	54920 KB	Output is correct
3	Correct	25 ms	54920 KB	Output is correct
4	Correct	24 ms	54920 KB	Output is correct
5	Correct	26 ms	54920 KB	Output is correct
6	Correct	26 ms	54920 KB	Output is correct
7	Correct	22 ms	54920 KB	Output is correct
8	Correct	22 ms	54920 KB	Output is correct
9	Correct	23 ms	54920 KB	Output is correct
10	Correct	22 ms	54920 KB	Output is correct
11	Correct	21 ms	54920 KB	Output is correct

Subtask #4
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	23800 KB	Output is correct
2	Correct	23 ms	23932 KB	Output is correct
3	Correct	20 ms	23992 KB	Output is correct
4	Correct	26 ms	25004 KB	Output is correct
5	Correct	107 ms	54844 KB	Output is correct
6	Correct	23 ms	54844 KB	Output is correct
7	Correct	24 ms	54844 KB	Output is correct
8	Correct	105 ms	54912 KB	Output is correct
9	Correct	94 ms	54920 KB	Output is correct
10	Correct	24 ms	54920 KB	Output is correct
11	Correct	23 ms	54920 KB	Output is correct
12	Correct	22 ms	54920 KB	Output is correct
13	Correct	20 ms	54920 KB	Output is correct
14	Correct	21 ms	54920 KB	Output is correct
15	Correct	24 ms	54920 KB	Output is correct
16	Correct	24 ms	54920 KB	Output is correct
17	Correct	23 ms	54920 KB	Output is correct
18	Correct	24 ms	54920 KB	Output is correct
19	Correct	24 ms	54920 KB	Output is correct
20	Correct	25 ms	54920 KB	Output is correct
21	Correct	25 ms	54920 KB	Output is correct
22	Correct	25 ms	54920 KB	Output is correct
23	Correct	24 ms	54920 KB	Output is correct
24	Correct	26 ms	54920 KB	Output is correct
25	Correct	26 ms	54920 KB	Output is correct
26	Correct	22 ms	54920 KB	Output is correct
27	Correct	22 ms	54920 KB	Output is correct
28	Correct	23 ms	54920 KB	Output is correct
29	Correct	22 ms	54920 KB	Output is correct
30	Correct	21 ms	54920 KB	Output is correct
31	Correct	92 ms	54968 KB	Output is correct
32	Correct	87 ms	55024 KB	Output is correct
33	Correct	110 ms	55080 KB	Output is correct
34	Correct	130 ms	55080 KB	Output is correct
35	Correct	130 ms	55080 KB	Output is correct
36	Correct	121 ms	55100 KB	Output is correct
37	Correct	114 ms	55100 KB	Output is correct
38	Correct	99 ms	55108 KB	Output is correct
39	Correct	68 ms	55108 KB	Output is correct
40	Correct	104 ms	55140 KB	Output is correct
41	Correct	94 ms	55140 KB	Output is correct
42	Correct	83 ms	55140 KB	Output is correct
43	Correct	99 ms	55140 KB	Output is correct
44	Correct	119 ms	55140 KB	Output is correct
45	Correct	95 ms	55140 KB	Output is correct
46	Correct	105 ms	55140 KB	Output is correct
47	Correct	110 ms	55140 KB	Output is correct
48	Correct	89 ms	55140 KB	Output is correct
49	Correct	87 ms	55140 KB	Output is correct
50	Correct	61 ms	55140 KB	Output is correct
51	Correct	178 ms	55140 KB	Output is correct
52	Correct	61 ms	55140 KB	Output is correct
53	Correct	59 ms	55140 KB	Output is correct
54	Correct	66 ms	55140 KB	Output is correct
55	Correct	66 ms	55140 KB	Output is correct
56	Correct	69 ms	55140 KB	Output is correct
57	Correct	70 ms	55140 KB	Output is correct
58	Correct	93 ms	55140 KB	Output is correct

Submission #58102

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #1
19.0 / 19.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0