oj.uz

Submission #735413

# Submission time Handle Problem Language Result Execution time Memory
735413 2023-05-04T05:35:18 Z Nelt Bank (IZhO14_bank) C++17
100 / 100
 197 ms 58196 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 20, MAX = 1005;
ll a[N], b[N];
short dp[1 << N][N + 1];
vv(ll) sum[MAX * N];
ll n, m;
bool solve(ll msk, ll i)
{
    if (i == n)
        return true;
    if (dp[msk][i] != -1)
        return dp[msk][i];
    for (ll sub : sum[a[i]])
        if ((sub & msk) == sub and solve(msk ^ sub, i + 1))
            return dp[msk][i] = true;
    return dp[msk][i] = false;
}
void solve()
{
    cin >> n >> m;
    for (ll i = 0; i < n; i++)
        cin >> a[i];
    for (ll i = 0; i < m; i++)
        cin >> b[i];
    ll s;
    for (ll msk = 0; msk < (1 << m); msk++)
    {
        s = 0;
        for (ll i = 0; i < m; i++)
            if (msk >> i & 1)
                s += b[i];
        sum[s].pb(msk);
        for (ll i = 0; i < n; i++)
            dp[msk][i] = -1;
    }
    cout << (solve((1 << m) - 1, 0) ? "YES\n" : "NO\n");
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Compilation message

bank.cpp: In function 'bool solve(long long int, long long int)':
bank.cpp:57:31: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   57 |             return dp[msk][i] = true;
      |                    ~~~~~~~~~~~^~~~~~
bank.cpp:58:23: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   58 |     return dp[msk][i] = false;
      |            ~~~~~~~~~~~^~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 3 ms 2516 KB Output is correct
5 Correct 78 ms 55824 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 86 ms 54644 KB Output is correct
9 Correct 75 ms 55204 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 3 ms 2516 KB Output is correct
5 Correct 78 ms 55824 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 86 ms 54644 KB Output is correct
9 Correct 75 ms 55204 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 2 ms 1620 KB Output is correct
21 Correct 3 ms 1620 KB Output is correct
22 Correct 3 ms 1748 KB Output is correct
23 Correct 2 ms 1620 KB Output is correct
24 Correct 2 ms 1620 KB Output is correct
25 Correct 2 ms 1620 KB Output is correct
26 Correct 2 ms 1620 KB Output is correct
27 Correct 3 ms 1620 KB Output is correct
28 Correct 3 ms 1620 KB Output is correct
29 Correct 3 ms 1620 KB Output is correct
30 Correct 2 ms 1620 KB Output is correct
31 Correct 76 ms 55640 KB Output is correct
32 Correct 73 ms 55456 KB Output is correct
33 Correct 81 ms 55700 KB Output is correct
34 Correct 80 ms 56492 KB Output is correct
35 Correct 86 ms 58196 KB Output is correct
36 Correct 84 ms 57368 KB Output is correct
37 Correct 82 ms 58188 KB Output is correct
38 Correct 91 ms 57564 KB Output is correct
39 Correct 74 ms 53240 KB Output is correct
40 Correct 83 ms 56712 KB Output is correct
41 Correct 83 ms 56356 KB Output is correct
42 Correct 93 ms 54348 KB Output is correct
43 Correct 77 ms 57076 KB Output is correct
44 Correct 88 ms 58052 KB Output is correct
45 Correct 79 ms 55436 KB Output is correct
46 Correct 83 ms 57288 KB Output is correct
47 Correct 84 ms 57168 KB Output is correct
48 Correct 74 ms 54860 KB Output is correct
49 Correct 79 ms 55260 KB Output is correct
50 Correct 79 ms 53268 KB Output is correct
51 Correct 82 ms 54924 KB Output is correct
52 Correct 72 ms 53312 KB Output is correct
53 Correct 72 ms 53508 KB Output is correct
54 Correct 73 ms 53328 KB Output is correct
55 Correct 77 ms 53352 KB Output is correct
56 Correct 81 ms 54564 KB Output is correct
57 Correct 197 ms 54524 KB Output is correct
58 Correct 83 ms 54460 KB Output is correct