oj.uz

Submission #332234

# Submission time Handle Problem Language Result Execution time Memory
332234 2020-12-01T18:13:19 Z topovik Bank (IZhO14_bank) C++14
100 / 100
 900 ms 152172 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define f first
#define s second
#define pb push_back
#define INF 1000000000

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;

typedef tree<
ll,
null_type,
greater<ll>,
rb_tree_tag,
tree_order_statistics_node_update> ordered_set;

const ll N = 1 << 20;

set <short int> st[N];
set<short int> st1[N];

int gd[N];

int main()
{
//    freopen("bank.in", "r", stdin);
//    freopen("bank.out", "w", stdout);
    int n, m;
    cin >> n >> m;
    int a[n], b[m];
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    swap(n, m);
    for (int i = 0; i < (1 << n); i++)
    {
        int kol = 0;
        for (int j = 0; j < n; j++) kol += (i&(1 << j)) > 0;
        gd[i] = kol;
    }
    st1[0].insert(0);
    for (int j = 0; j < m; j++)
    {
        for (int i = 0; i < (1 << n); i++) st[i] = st1[i], st1[i].clear();
        for (int i = 0; i < (1 << n); i++)
          if ((n - gd[i]) >= (m - (j + 1)))
        {
            if (st[i].find(a[j]) != st[i].end())
            {
                st1[i].insert(0);
                continue;
            }
            for (auto g : st[i])
            {
                for (int c = 0; c < n; c++)
                    if (((1 << c)&i) == 0 && g + b[c] <= a[j] && (n - gd[i + (1 << c)]) >= (m - (j + 1))) st[i + (1 << c)].insert(g + b[c]);
            }
        }
    }
    for (int i = 0; i < (1 << n); i++)
        if (st1[i].size() > 0) {cout << "YES";return 0;}
    cout << "NO";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 98796 KB Output is correct
2 Correct 67 ms 98796 KB Output is correct
3 Correct 64 ms 98796 KB Output is correct
4 Correct 72 ms 99308 KB Output is correct
5 Correct 113 ms 102892 KB Output is correct
6 Correct 68 ms 98796 KB Output is correct
7 Correct 75 ms 98924 KB Output is correct
8 Correct 264 ms 125548 KB Output is correct
9 Correct 394 ms 152172 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 98796 KB Output is correct
2 Correct 64 ms 98796 KB Output is correct
3 Correct 68 ms 98796 KB Output is correct
4 Correct 66 ms 98796 KB Output is correct
5 Correct 65 ms 98844 KB Output is correct
6 Correct 66 ms 98796 KB Output is correct
7 Correct 67 ms 98924 KB Output is correct
8 Correct 74 ms 98796 KB Output is correct
9 Correct 68 ms 98924 KB Output is correct
10 Correct 64 ms 98796 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 98872 KB Output is correct
2 Correct 68 ms 99052 KB Output is correct
3 Correct 68 ms 98924 KB Output is correct
4 Correct 70 ms 98924 KB Output is correct
5 Correct 67 ms 98924 KB Output is correct
6 Correct 66 ms 98924 KB Output is correct
7 Correct 68 ms 98924 KB Output is correct
8 Correct 67 ms 98924 KB Output is correct
9 Correct 68 ms 98924 KB Output is correct
10 Correct 67 ms 98924 KB Output is correct
11 Correct 70 ms 98924 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 98796 KB Output is correct
2 Correct 67 ms 98796 KB Output is correct
3 Correct 64 ms 98796 KB Output is correct
4 Correct 72 ms 99308 KB Output is correct
5 Correct 113 ms 102892 KB Output is correct
6 Correct 68 ms 98796 KB Output is correct
7 Correct 75 ms 98924 KB Output is correct
8 Correct 264 ms 125548 KB Output is correct
9 Correct 394 ms 152172 KB Output is correct
10 Correct 67 ms 98796 KB Output is correct
11 Correct 64 ms 98796 KB Output is correct
12 Correct 68 ms 98796 KB Output is correct
13 Correct 66 ms 98796 KB Output is correct
14 Correct 65 ms 98844 KB Output is correct
15 Correct 66 ms 98796 KB Output is correct
16 Correct 67 ms 98924 KB Output is correct
17 Correct 74 ms 98796 KB Output is correct
18 Correct 68 ms 98924 KB Output is correct
19 Correct 64 ms 98796 KB Output is correct
20 Correct 67 ms 98872 KB Output is correct
21 Correct 68 ms 99052 KB Output is correct
22 Correct 68 ms 98924 KB Output is correct
23 Correct 70 ms 98924 KB Output is correct
24 Correct 67 ms 98924 KB Output is correct
25 Correct 66 ms 98924 KB Output is correct
26 Correct 68 ms 98924 KB Output is correct
27 Correct 67 ms 98924 KB Output is correct
28 Correct 68 ms 98924 KB Output is correct
29 Correct 67 ms 98924 KB Output is correct
30 Correct 70 ms 98924 KB Output is correct
31 Correct 447 ms 124112 KB Output is correct
32 Correct 543 ms 127212 KB Output is correct
33 Correct 223 ms 104172 KB Output is correct
34 Correct 248 ms 103020 KB Output is correct
35 Correct 260 ms 103020 KB Output is correct
36 Correct 383 ms 102892 KB Output is correct
37 Correct 123 ms 103020 KB Output is correct
38 Correct 153 ms 102892 KB Output is correct
39 Correct 380 ms 118380 KB Output is correct
40 Correct 243 ms 102892 KB Output is correct
41 Correct 386 ms 102972 KB Output is correct
42 Correct 381 ms 112492 KB Output is correct
43 Correct 228 ms 103404 KB Output is correct
44 Correct 327 ms 103020 KB Output is correct
45 Correct 293 ms 112492 KB Output is correct
46 Correct 259 ms 108652 KB Output is correct
47 Correct 324 ms 102892 KB Output is correct
48 Correct 155 ms 110828 KB Output is correct
49 Correct 108 ms 102892 KB Output is correct
50 Correct 416 ms 103916 KB Output is correct
51 Correct 253 ms 103276 KB Output is correct
52 Correct 267 ms 103660 KB Output is correct
53 Correct 900 ms 131020 KB Output is correct
54 Correct 462 ms 104044 KB Output is correct
55 Correct 431 ms 103916 KB Output is correct
56 Correct 500 ms 106348 KB Output is correct
57 Correct 391 ms 102892 KB Output is correct
58 Correct 498 ms 106476 KB Output is correct