oj.uz

Submission #488456

# Submission time Handle Problem Language Result Execution time Memory
488456 2021-11-19T05:16:22 Z saransh2708 Bank (IZhO14_bank) C++14
100 / 100
 152 ms 16712 KB 
//....SARANSH GUPTA....\  

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(p, n) for (int i = p; i < n; i++)
#define FIO                           \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define endl "\n"
#define pb push_back
#define mod 1000000007
#define all(a) a.begin(), a.end()

const int N = 21, INF = 1e12;
int n, x, y, z, ans, k, q, m;

int a[N], b[N];

signed main()
{
    cin >> n;
    cin >> m;
    fo(0, n) cin >> a[i];
    fo(0, m) cin >> b[i];
    sort(a, a + n);
    sort(b, b + m);
    array<int, 2> dp[(1LL << m) + 2];
    fo(0, 1LL << m)
        dp[i] = {0, 0};
    for (int mask = 0; mask < (1LL << m) - 1; mask++)
    {
        int current = dp[mask][0];
        int curr_val = dp[mask][1];
        fo(0, m)
        {
            int val = 1LL << i;
            if (val & mask)
            {
                continue;
            }
            if (current == n)
            {
                dp[mask | val] = {n, 0};
            }
            else
            {
                if (curr_val + b[i] == a[current])
                {
                    dp[mask | val] = max(dp[mask | val], {current + 1, 0});
                }
                else if (curr_val + b[i] < a[current])
                {
                    dp[mask | val] = max(dp[mask | val], {current, curr_val + b[i]});
                }
                else
                {
                    dp[mask | val] = max(dp[mask | val], dp[mask]);
                }
            }
        }
    }
    if (dp[(1LL << m) - 1][0] == n)
        cout << "YES\n";
    else
        cout << "NO\n";
}

Compilation message

bank.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //....SARANSH GUPTA....\
      | ^

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 109 ms 16588 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 107 ms 16684 KB Output is correct
9 Correct 106 ms 16708 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 109 ms 16588 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 107 ms 16684 KB Output is correct
9 Correct 106 ms 16708 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 292 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 3 ms 464 KB Output is correct
22 Correct 2 ms 464 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 2 ms 464 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 2 ms 464 KB Output is correct
31 Correct 112 ms 16592 KB Output is correct
32 Correct 108 ms 16592 KB Output is correct
33 Correct 137 ms 16712 KB Output is correct
34 Correct 113 ms 16592 KB Output is correct
35 Correct 119 ms 16684 KB Output is correct
36 Correct 109 ms 16592 KB Output is correct
37 Correct 109 ms 16688 KB Output is correct
38 Correct 107 ms 16684 KB Output is correct
39 Correct 77 ms 16620 KB Output is correct
40 Correct 105 ms 16684 KB Output is correct
41 Correct 107 ms 16688 KB Output is correct
42 Correct 119 ms 16688 KB Output is correct
43 Correct 152 ms 16692 KB Output is correct
44 Correct 116 ms 16684 KB Output is correct
45 Correct 127 ms 16692 KB Output is correct
46 Correct 137 ms 16596 KB Output is correct
47 Correct 116 ms 16596 KB Output is correct
48 Correct 94 ms 16688 KB Output is correct
49 Correct 108 ms 16692 KB Output is correct
50 Correct 101 ms 16592 KB Output is correct
51 Correct 113 ms 16692 KB Output is correct
52 Correct 116 ms 16688 KB Output is correct
53 Correct 109 ms 16696 KB Output is correct
54 Correct 102 ms 16592 KB Output is correct
55 Correct 102 ms 16712 KB Output is correct
56 Correct 100 ms 16592 KB Output is correct
57 Correct 101 ms 16688 KB Output is correct
58 Correct 102 ms 16688 KB Output is correct