oj.uz

Submission #886277

# Submission time Handle Problem Language Result Execution time Memory
886277 2023-12-11T16:57:32 Z dwuy Bank (IZhO14_bank) C++14
100 / 100
 60 ms 21924 KB 
/// dwuy: _,\,,,_\,__,\,,_
#include <bits/stdc++.h>

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK ""
#define int long long

using namespace std;

typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;

const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;

int n, m;
int a[50];
int b[50];
int pf[50];
bool f[MASK(20)][21];

void nhap(){
    cin >> n >> m;
    for(int i=1; i<=n; i++) cin >> a[i], pf[i] = pf[i-1] + a[i];
    for(int i=0; i<m; i++) cin >> b[i];
}

void solve(){
    f[0][0] = 1;
    bool ans = 0;
    for(int mask=1; mask<MASK(m); mask++){
        int sum = 0;
        for(int t=mask; t; t-=-t&t) sum += b[__lg(-t&t)];
        int i=0;
        while(i<=n && pf[i]<sum) i++;
        if(i>n) continue;
        for(int t=mask; t; t-=-t&t){
            int Mask = mask^(-t&t);
            int pre = sum - b[__lg(-t&t)];
            if(f[Mask][i] || (pre==pf[i-1] && f[Mask][i-1])){
                f[mask][i] = 1;
                break;
            }
        }
        if(sum == pf[n] && i==n && f[mask][i]) ans = 1;
    }
    cout << (ans? "YES":"NO");
}

int32_t main(){
    fastIO;
    //file(TASK);

    nhap();
    solve();

    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 22 ms 4588 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 30 ms 21588 KB Output is correct
9 Correct 27 ms 21916 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 22 ms 4588 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 30 ms 21588 KB Output is correct
9 Correct 27 ms 21916 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 464 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 2472 KB Output is correct
31 Correct 35 ms 21844 KB Output is correct
32 Correct 32 ms 21912 KB Output is correct
33 Correct 60 ms 17232 KB Output is correct
34 Correct 53 ms 2236 KB Output is correct
35 Correct 54 ms 2492 KB Output is correct
36 Correct 59 ms 848 KB Output is correct
37 Correct 24 ms 12840 KB Output is correct
38 Correct 25 ms 2396 KB Output is correct
39 Correct 35 ms 21452 KB Output is correct
40 Correct 49 ms 604 KB Output is correct
41 Correct 60 ms 704 KB Output is correct
42 Correct 52 ms 21840 KB Output is correct
43 Correct 58 ms 7392 KB Output is correct
44 Correct 56 ms 536 KB Output is correct
45 Correct 42 ms 21840 KB Output is correct
46 Correct 57 ms 21076 KB Output is correct
47 Correct 54 ms 848 KB Output is correct
48 Correct 26 ms 21408 KB Output is correct
49 Correct 22 ms 4444 KB Output is correct
50 Correct 43 ms 21912 KB Output is correct
51 Correct 54 ms 1544 KB Output is correct
52 Correct 58 ms 20820 KB Output is correct
53 Correct 31 ms 21844 KB Output is correct
54 Correct 37 ms 21924 KB Output is correct
55 Correct 37 ms 21912 KB Output is correct
56 Correct 35 ms 21840 KB Output is correct
57 Correct 36 ms 21904 KB Output is correct
58 Correct 36 ms 21924 KB Output is correct