oj.uz

Submission #723399

# Submission time Handle Problem Language Result Execution time Memory
723399 2023-04-13T17:22:44 Z quochuy147 Bank (IZhO14_bank) C++14
100 / 100
 108 ms 8532 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define file "bank" 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}

const int mod = 1e9 + 7;
const int N = 20;

int n, m;
int a[N + 5], b[N + 5];
pii f[MASK(N) + 5];

void inp()
{
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= m; ++i) cin >> b[i];    
}

void solve()
{
    for(int i = 1; i < MASK(m); ++i) f[i].fi = -1;
    f[0] = {1, 0};
    for(int i = 1; i < MASK(m); ++i)
        for(int j = 1; j <= m; ++j) {
            if(MASK(j - 1) & i) {
                int pre = MASK(j - 1) ^ i;
                if(f[pre].fi == -1) continue;
                int cnt = f[pre].fi, val = f[pre].se;
                if(val + b[j] < a[cnt]) f[i] = {f[pre].fi, val + b[j]};
                if(val + b[j] == a[cnt]) f[i] = {f[pre].fi + 1, 0};
                if(f[i].fi > n) {
                    cout << "YES";
                    return ;
                }
            }
        }
    cout << "NO";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    // freopen(file".in" , "r" , stdin);
    // freopen(file".out" , "w" , stdout);
    inp();
    solve();
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 76 ms 8516 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 68 ms 8504 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 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 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 452 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 76 ms 8516 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 5 ms 8532 KB Output is correct
9 Correct 68 ms 8504 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 456 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 452 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 90 ms 8508 KB Output is correct
32 Correct 89 ms 8404 KB Output is correct
33 Correct 77 ms 8404 KB Output is correct
34 Correct 77 ms 8508 KB Output is correct
35 Correct 67 ms 8512 KB Output is correct
36 Correct 66 ms 8404 KB Output is correct
37 Correct 70 ms 8504 KB Output is correct
38 Correct 69 ms 8512 KB Output is correct
39 Correct 5 ms 8404 KB Output is correct
40 Correct 70 ms 8404 KB Output is correct
41 Correct 67 ms 8404 KB Output is correct
42 Correct 108 ms 8524 KB Output is correct
43 Correct 68 ms 8404 KB Output is correct
44 Correct 67 ms 8504 KB Output is correct
45 Correct 5 ms 8404 KB Output is correct
46 Correct 100 ms 8512 KB Output is correct
47 Correct 68 ms 8404 KB Output is correct
48 Correct 4 ms 8516 KB Output is correct
49 Correct 65 ms 8524 KB Output is correct
50 Correct 78 ms 8520 KB Output is correct
51 Correct 66 ms 8404 KB Output is correct
52 Correct 68 ms 8404 KB Output is correct
53 Correct 104 ms 8504 KB Output is correct
54 Correct 91 ms 8508 KB Output is correct
55 Correct 81 ms 8504 KB Output is correct
56 Correct 89 ms 8508 KB Output is correct
57 Correct 104 ms 8532 KB Output is correct
58 Correct 80 ms 8508 KB Output is correct