oj.uz

Submission #947217

# Submission time Handle Problem Language Result Execution time Memory
947217 2024-03-15T17:04:30 Z steveonalex Bank (IZhO14_bank) C++11
100 / 100
 155 ms 4704 KB 
#include <bits/stdc++.h>


 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int dp[MASK(20)];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m; cin >> n >> m;
    vector<int> a(n), b(m);
    for(int i = 0; i<n; ++i) cin >> a[i];
    for(int j = 0; j<m; ++j) cin >> b[j];

    for(int i = 1; i<n; ++i) a[i] += a[i-1];

    bool ok = false;
    for(int mask = 1; mask < MASK(m); ++mask){
        int sum = 0;
        for(int i = 0;i < m; ++i) if (GETBIT(mask, i)) sum += b[i];

        int cur = 0;
        if (binary_search(ALL(a), sum)){
            int idx = lower_bound(ALL(a), sum) - a.begin();
            cur = MASK(idx);
        }
        for(int i = 0; i<m; ++i) if (GETBIT(mask, i))
            maximize(dp[mask], dp[mask - MASK(i)]);
        dp[mask] |= cur;
        if (dp[mask] == MASK(n) - 1) ok = true;
    }
    if (ok) cout << "YES\n";
    else cout << "NO\n";
 
    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:62:28: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   62 |     for(int mask = 1; mask < MASK(m); ++mask){
      |                            ^
bank.cpp:74:22: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   74 |         if (dp[mask] == MASK(n) - 1) ok = true;
      |             ~~~~~~~~~^~~~~~~~~~~~~~

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 1 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 141 ms 4300 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 135 ms 4416 KB Output is correct
9 Correct 136 ms 4300 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 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 0 ms 348 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 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 500 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 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 1 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 141 ms 4300 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 135 ms 4416 KB Output is correct
9 Correct 136 ms 4300 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 344 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 0 ms 348 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 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 3 ms 500 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 135 ms 4416 KB Output is correct
32 Correct 141 ms 4432 KB Output is correct
33 Correct 141 ms 4512 KB Output is correct
34 Correct 141 ms 4432 KB Output is correct
35 Correct 143 ms 4432 KB Output is correct
36 Correct 150 ms 4432 KB Output is correct
37 Correct 137 ms 4412 KB Output is correct
38 Correct 138 ms 4424 KB Output is correct
39 Correct 138 ms 4432 KB Output is correct
40 Correct 143 ms 4436 KB Output is correct
41 Correct 150 ms 4456 KB Output is correct
42 Correct 138 ms 4436 KB Output is correct
43 Correct 152 ms 4704 KB Output is correct
44 Correct 155 ms 4368 KB Output is correct
45 Correct 142 ms 4432 KB Output is correct
46 Correct 147 ms 4296 KB Output is correct
47 Correct 147 ms 4372 KB Output is correct
48 Correct 135 ms 4432 KB Output is correct
49 Correct 137 ms 4436 KB Output is correct
50 Correct 152 ms 4688 KB Output is correct
51 Correct 138 ms 4432 KB Output is correct
52 Correct 141 ms 4456 KB Output is correct
53 Correct 140 ms 4336 KB Output is correct
54 Correct 148 ms 4432 KB Output is correct
55 Correct 148 ms 4432 KB Output is correct
56 Correct 152 ms 4456 KB Output is correct
57 Correct 151 ms 4592 KB Output is correct
58 Correct 150 ms 4472 KB Output is correct