oj.uz

Submission #948905

# Submission time Handle Problem Language Result Execution time Memory
948905 2024-03-18T16:07:54 Z tnknguyen_ Bank (IZhO14_bank) C++14
100 / 100
 106 ms 17236 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n' 
#define MASK(k) (1LL<<k)
#define pii pair<int, int>

int n, m;
int a[30], b[30];

// ------------ SUBTASKS ------------
namespace SUB1{
    bool ok(){
        return (n == 1);
    }

    void solve(){
        vector<int> f(1e3+5, 0);    
        f[0] = 1;
        for(int i=1; i<=m; ++i){
            for(int j=a[1]; j>=b[i]; --j){
                f[j] |= f[j - b[i]];
            }
        }

        cout<<(f[a[1]] ? "YES" : "NO");
        
        //-----------------------------
        exit(0);
    }
}

int v[21][MASK(21)];
int f[21][MASK(21)];
namespace SUB23{
    bool ok(){
        return (m <= 14);
    }

    void solve(){
        for(int i=0; i<MASK(m); ++i){
            int sum = 0;
            for(int j=i; j!=0; j-=(j&-j)){
                sum += b[__lg((j&-j)) + 1];
            }
            for(int j=1; j<=n; ++j){
                if(a[j] == sum){
                    v[j][i] = 1;
                }
            }
        }

        f[0][0] = 1;
        int fl = 1;
        for(int i=1; i<=n; ++i){
            int b = 0;
            for(int y=0; y<MASK(m); ++y){
                if(f[i-1][y] == 1){
                    for(int x=0; x<MASK(m); ++x){
                        if((x & y) == 0 && v[i][x] == 1){
                            f[i][x | y] = 1;
                            b = 1;
                        }
                    }
                }
            }
            if(!b){
                fl = 0;
                break;
            }
        }
        cout<<(fl ? "YES" : "NO");
        
        //-----------------------------
        exit(0);
    }
}

pii g[MASK(21) + 5];
namespace SUB4{
    void solve(){
        for(int i=0; i<MASK(m); ++i){
            g[i] = {1, 0};
        }
        int ans = 0;
        for(int i=0; i<MASK(m); ++i){
            int k = g[i].first, w = g[i].second;
            for(int j=0; j<m; ++j){
                if((MASK(j) & i)){
                    continue;
                }
                int msk = (i | MASK(j));
                pii nxt = {k, w + b[j+1]};
                if(w + b[j+1] == a[k]){
                    nxt = {k+1, 0};
                }
                g[msk] = (nxt.first > g[msk].first ? nxt : g[msk]); //take pair with larger first value.
                g[msk] = max(g[msk], nxt);
            }
            ans = max(ans, g[i].first);
        }

        cout<<(ans > n ? "YES" : "NO");
        //-----------------------------
        exit(0);
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    //freopen("main.inp","r",stdin);
    //freopen("main.out","w",stdout);

    //f[mask][i] = 
    cin>>n>>m;
    for(int i=1; i<=n; ++i){
        cin>>a[i];
    }
    for(int j=1; j<=m; ++j){
        cin>>b[j];
    }

    // if(SUB1::ok()){
    //     SUB1::solve();
    // }
    // if(SUB23::ok()){
    //     SUB23::solve();
    // }
    SUB4::solve();

    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 2648 KB Output is correct
5 Correct 82 ms 17028 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 91 ms 16988 KB Output is correct
9 Correct 79 ms 16984 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2684 KB Output is correct
10 Correct 2 ms 2660 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 2648 KB Output is correct
5 Correct 82 ms 17028 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 91 ms 16988 KB Output is correct
9 Correct 79 ms 16984 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 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 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2652 KB Output is correct
28 Correct 2 ms 2684 KB Output is correct
29 Correct 2 ms 2660 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 88 ms 17028 KB Output is correct
32 Correct 89 ms 17032 KB Output is correct
33 Correct 94 ms 17032 KB Output is correct
34 Correct 86 ms 17028 KB Output is correct
35 Correct 90 ms 17036 KB Output is correct
36 Correct 83 ms 16988 KB Output is correct
37 Correct 84 ms 17032 KB Output is correct
38 Correct 79 ms 17036 KB Output is correct
39 Correct 77 ms 17032 KB Output is correct
40 Correct 84 ms 16988 KB Output is correct
41 Correct 82 ms 16988 KB Output is correct
42 Correct 100 ms 17036 KB Output is correct
43 Correct 91 ms 16988 KB Output is correct
44 Correct 87 ms 17028 KB Output is correct
45 Correct 106 ms 16984 KB Output is correct
46 Correct 96 ms 16988 KB Output is correct
47 Correct 83 ms 16988 KB Output is correct
48 Correct 92 ms 17036 KB Output is correct
49 Correct 79 ms 17028 KB Output is correct
50 Correct 86 ms 17036 KB Output is correct
51 Correct 87 ms 17032 KB Output is correct
52 Correct 83 ms 16988 KB Output is correct
53 Correct 92 ms 17236 KB Output is correct
54 Correct 80 ms 16984 KB Output is correct
55 Correct 77 ms 17028 KB Output is correct
56 Correct 81 ms 16984 KB Output is correct
57 Correct 80 ms 16984 KB Output is correct
58 Correct 82 ms 16984 KB Output is correct