oj.uz

Submission #342698

# Submission time Handle Problem Language Result Execution time Memory
342698 2021-01-02T16:23:29 Z IZhO_2021_I_want_Silver Bank (IZhO14_bank) C++14
100 / 100
 53 ms 50540 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = (1 << 21) - 1;
const int oo = 1e9 + 5;

int n, m, a[N], b[N];
vector <int> good[N];
bool was[N];

void go(int pos, int need, int ind, int cur, int mask) {
    if (cur > need) { return; }
    if (pos == m+1) {
        if (need == cur) { good[ind].pb(mask); }
        return;
    }
    go(pos+1, need, ind, cur, mask);
    go(pos+1, need, ind, cur+b[pos], mask + (1 << pos));
}

void rec(int pos, int mask) {
    if (was[mask]) { return; }
    was[mask] = 1;

    if (pos == n + 1) {
        cout << "YES";
        exit(0);
    }
    for (int i = 0; i < sz(good[pos]); ++i) {
        if ((mask & good[pos][i]) == 0) {
            rec(pos+1, (mask ^ good[pos][i]));
        }
    }
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for (int i = 1; i <= m; ++i) {
        cin >> b[i];
    }
    sort(a + 1, a + n + 1);
    sort(b + 1, b + m + 1);
    for (int i = 1; i <= n; ++i) {
        go(1, a[i], i, 0, 0);
    }
    rec(1, 0);
    cout << "NO";
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message

bank.cpp:87:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   87 |  main () {
      |        ^

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 49644 KB Output is correct
2 Correct 34 ms 49644 KB Output is correct
3 Correct 34 ms 49644 KB Output is correct
4 Correct 34 ms 49644 KB Output is correct
5 Correct 35 ms 49644 KB Output is correct
6 Correct 36 ms 49644 KB Output is correct
7 Correct 34 ms 49644 KB Output is correct
8 Correct 41 ms 49644 KB Output is correct
9 Correct 42 ms 49644 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 49644 KB Output is correct
2 Correct 34 ms 49644 KB Output is correct
3 Correct 35 ms 49644 KB Output is correct
4 Correct 34 ms 49644 KB Output is correct
5 Correct 34 ms 49644 KB Output is correct
6 Correct 33 ms 49644 KB Output is correct
7 Correct 34 ms 49644 KB Output is correct
8 Correct 33 ms 49644 KB Output is correct
9 Correct 36 ms 49536 KB Output is correct
10 Correct 34 ms 49644 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 49644 KB Output is correct
2 Correct 34 ms 49644 KB Output is correct
3 Correct 38 ms 49644 KB Output is correct
4 Correct 35 ms 49644 KB Output is correct
5 Correct 34 ms 49644 KB Output is correct
6 Correct 36 ms 49644 KB Output is correct
7 Correct 39 ms 49644 KB Output is correct
8 Correct 36 ms 49772 KB Output is correct
9 Correct 33 ms 49644 KB Output is correct
10 Correct 34 ms 49644 KB Output is correct
11 Correct 40 ms 49644 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 49644 KB Output is correct
2 Correct 34 ms 49644 KB Output is correct
3 Correct 34 ms 49644 KB Output is correct
4 Correct 34 ms 49644 KB Output is correct
5 Correct 35 ms 49644 KB Output is correct
6 Correct 36 ms 49644 KB Output is correct
7 Correct 34 ms 49644 KB Output is correct
8 Correct 41 ms 49644 KB Output is correct
9 Correct 42 ms 49644 KB Output is correct
10 Correct 33 ms 49644 KB Output is correct
11 Correct 34 ms 49644 KB Output is correct
12 Correct 35 ms 49644 KB Output is correct
13 Correct 34 ms 49644 KB Output is correct
14 Correct 34 ms 49644 KB Output is correct
15 Correct 33 ms 49644 KB Output is correct
16 Correct 34 ms 49644 KB Output is correct
17 Correct 33 ms 49644 KB Output is correct
18 Correct 36 ms 49536 KB Output is correct
19 Correct 34 ms 49644 KB Output is correct
20 Correct 34 ms 49644 KB Output is correct
21 Correct 34 ms 49644 KB Output is correct
22 Correct 38 ms 49644 KB Output is correct
23 Correct 35 ms 49644 KB Output is correct
24 Correct 34 ms 49644 KB Output is correct
25 Correct 36 ms 49644 KB Output is correct
26 Correct 39 ms 49644 KB Output is correct
27 Correct 36 ms 49772 KB Output is correct
28 Correct 33 ms 49644 KB Output is correct
29 Correct 34 ms 49644 KB Output is correct
30 Correct 40 ms 49644 KB Output is correct
31 Correct 53 ms 49644 KB Output is correct
32 Correct 52 ms 49772 KB Output is correct
33 Correct 35 ms 49644 KB Output is correct
34 Correct 34 ms 49644 KB Output is correct
35 Correct 34 ms 49644 KB Output is correct
36 Correct 34 ms 49644 KB Output is correct
37 Correct 34 ms 49644 KB Output is correct
38 Correct 34 ms 49644 KB Output is correct
39 Correct 34 ms 49644 KB Output is correct
40 Correct 34 ms 49644 KB Output is correct
41 Correct 36 ms 49644 KB Output is correct
42 Correct 46 ms 50504 KB Output is correct
43 Correct 37 ms 49900 KB Output is correct
44 Correct 37 ms 49644 KB Output is correct
45 Correct 35 ms 49644 KB Output is correct
46 Correct 39 ms 49644 KB Output is correct
47 Correct 34 ms 49644 KB Output is correct
48 Correct 37 ms 49644 KB Output is correct
49 Correct 33 ms 49644 KB Output is correct
50 Correct 35 ms 49644 KB Output is correct
51 Correct 44 ms 49772 KB Output is correct
52 Correct 38 ms 50540 KB Output is correct
53 Correct 35 ms 49644 KB Output is correct
54 Correct 36 ms 49644 KB Output is correct
55 Correct 36 ms 49644 KB Output is correct
56 Correct 34 ms 49772 KB Output is correct
57 Correct 44 ms 50028 KB Output is correct
58 Correct 34 ms 49644 KB Output is correct