oj.uz

Submission #475598

# Submission time Handle Problem Language Result Execution time Memory
475598 2021-09-23T09:00:58 Z nohaxjustsoflo Bank (IZhO14_bank) C++17
19 / 100
 102 ms 8448 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++)
    {
        for(int j = 0; j < m; j++)
        {
            if(i&(1<<j))
            {
                int mask = i^(1<<j);
                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 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 93 ms 8392 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 102 ms 8448 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
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 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 93 ms 8392 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 102 ms 8448 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Incorrect 1 ms 332 KB Output isn't correct
12 Halted 0 ms 0 KB -