oj.uz

Submission #171446

# Submission time Handle Problem Language Result Execution time Memory
171446 2019-12-28T16:38:54 Z ne4eHbKa Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 13904 KB 
//{ <defines>
#ifndef _LOCAL
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#endif

#include <bits/stdc++.h>
using namespace std;

#define fr(i, n) for(int i = 0; i < (n); ++i)
#define fo(n) fr(i, (n))

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int(x.size())
#define pw(x) (1 << (x))
#define PW(x) (1ll << (x))
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset(x, y, sizeof x)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

const int oo = 2e9;
const ll OO = 4e18;
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int md = 0x3b800001;
const int MD = 1e9 + 7;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
//} </defines>
const int N = 20;
const int M = 1 << N;

int n, m, a[N], b[N], s[M];
vi f[(int)2e4 + 5];

void solve() {
    cin >> n >> m;
    fo(n) cin >> a[i];
    random_shuffle(a, a + n, [](int x){re rnd() % x;});
    fo(m) cin >> b[i];

#ifdef _LOCAL
    for(auto &p : f) p.clear();
#endif

    fo(1 << m) {
        fr(j, m) ifn(i & pw(j)) s[i ^ pw(j)] = s[i] + b[j];
        f[s[i]].pb(i);
    }

    vi G(1, 0), H; vi *g = &G, *h = &H;
    fo(n) {
        if(g -> empty() || f[a[i]].empty()) re void(cout << "NO\n");
        h -> resize(0);
        for(int t : *g) for(int j : f[a[i]]) ifn(j & t) h -> pb(j ^ t);
        swap(g, h);
    }
    cout << (g -> empty() ? "NO\n" : "YES\n");
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    fo(tests) {
		cerr << "case #" << i+1 << endl;
		solve();
	}
#else
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
#endif
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 760 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 5 ms 1144 KB Output is correct
5 Correct 97 ms 11128 KB Output is correct
6 Correct 2 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 94 ms 10616 KB Output is correct
9 Correct 96 ms 10844 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 888 KB Output is correct
2 Correct 3 ms 888 KB Output is correct
3 Correct 3 ms 888 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 764 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 3 ms 888 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1016 KB Output is correct
2 Correct 4 ms 1016 KB Output is correct
3 Correct 5 ms 1144 KB Output is correct
4 Correct 4 ms 1020 KB Output is correct
5 Correct 4 ms 1020 KB Output is correct
6 Correct 5 ms 1016 KB Output is correct
7 Correct 4 ms 1016 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 5 ms 1144 KB Output is correct
10 Correct 5 ms 988 KB Output is correct
11 Correct 4 ms 1016 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 760 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 5 ms 1144 KB Output is correct
5 Correct 97 ms 11128 KB Output is correct
6 Correct 2 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 94 ms 10616 KB Output is correct
9 Correct 96 ms 10844 KB Output is correct
10 Correct 3 ms 888 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 3 ms 764 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 2 ms 760 KB Output is correct
18 Correct 3 ms 888 KB Output is correct
19 Correct 3 ms 888 KB Output is correct
20 Correct 5 ms 1016 KB Output is correct
21 Correct 4 ms 1016 KB Output is correct
22 Correct 5 ms 1144 KB Output is correct
23 Correct 4 ms 1020 KB Output is correct
24 Correct 4 ms 1020 KB Output is correct
25 Correct 5 ms 1016 KB Output is correct
26 Correct 4 ms 1016 KB Output is correct
27 Correct 4 ms 1016 KB Output is correct
28 Correct 5 ms 1144 KB Output is correct
29 Correct 5 ms 988 KB Output is correct
30 Correct 4 ms 1016 KB Output is correct
31 Correct 100 ms 11356 KB Output is correct
32 Execution timed out 1016 ms 13904 KB Time limit exceeded
33 Halted 0 ms 0 KB -