oj.uz

Submission #475599

# Submission time Handle Problem Language Result Execution time Memory
475599 2021-09-23T09:02:13 Z nohaxjustsoflo Bank (IZhO14_bank) C++17
100 / 100
 125 ms 8508 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;


const int mxN = 20;
const int mod = 998244353;
const int mxlogN = 20;
const int mxK = 26;

int a[mxN];
int b[mxN];

int leftover[1<<mxN];
int people[1<<mxN];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen("bank.in", "r",stdin);
    //freopen("bank.out", "w",stdout);

    int n, m; cin >> n >> m;
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];
    for(int i = 0; i < (1<<m); i++)
    {
        people[i] = -1;
    }
    people[0] = 0;
    leftover[0] = 0;
    for(int i = 0; i < (1<<m); i++)
    {
        for(int j = 0; j < m; j++)
        {
            if(i&(1<<j))
            {
                int mask = i^(1<<j);
                if(people[mask]==-1)continue;
                int covered = people[mask];
                int lef = leftover[mask];
                if(b[j]+lef < a[covered])
                {
                    people[i] = people[mask];
                    leftover[i] = lef+b[j];
                }
                else if(b[j]+lef == a[covered])
                {
                    people[i] = people[mask]+1;
                    leftover[i] = 0;
                }
            }
        }
        if(people[i]==n)
        {
            cout << "YES\n";
            return 0;
        }
    }
    cout << "NO\n";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 77 ms 4436 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 2 ms 4428 KB Output is correct
9 Correct 99 ms 8424 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 77 ms 4436 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 2 ms 4428 KB Output is correct
9 Correct 99 ms 8424 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 1 ms 404 KB Output is correct
30 Correct 2 ms 448 KB Output is correct
31 Correct 107 ms 8412 KB Output is correct
32 Correct 117 ms 8508 KB Output is correct
33 Correct 84 ms 8364 KB Output is correct
34 Correct 75 ms 5444 KB Output is correct
35 Correct 74 ms 5444 KB Output is correct
36 Correct 77 ms 4644 KB Output is correct
37 Correct 74 ms 4804 KB Output is correct
38 Correct 74 ms 4536 KB Output is correct
39 Correct 3 ms 4300 KB Output is correct
40 Correct 75 ms 4488 KB Output is correct
41 Correct 73 ms 4496 KB Output is correct
42 Correct 125 ms 8464 KB Output is correct
43 Correct 78 ms 6852 KB Output is correct
44 Correct 74 ms 4440 KB Output is correct
45 Correct 4 ms 4428 KB Output is correct
46 Correct 102 ms 8492 KB Output is correct
47 Correct 73 ms 4548 KB Output is correct
48 Correct 2 ms 4428 KB Output is correct
49 Correct 75 ms 4528 KB Output is correct
50 Correct 93 ms 8388 KB Output is correct
51 Correct 77 ms 4780 KB Output is correct
52 Correct 80 ms 8444 KB Output is correct
53 Correct 121 ms 8440 KB Output is correct
54 Correct 104 ms 8388 KB Output is correct
55 Correct 96 ms 8404 KB Output is correct
56 Correct 95 ms 8388 KB Output is correct
57 Correct 98 ms 8388 KB Output is correct
58 Correct 93 ms 8492 KB Output is correct