oj.uz

Submission #781952

# Submission time Handle Problem Language Result Execution time Memory
781952 2023-07-13T14:06:54 Z nirmalg Bank (IZhO14_bank) C++14
100 / 100
 99 ms 8532 KB 
#include "bits/stdc++.h"
using namespace std;

// Template modified from https://usaco.guide/general/generic-code?lang=cpp#templates 

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvpii = vector<vpii>;

#define Sum(v) (accumulate(v.begin(), v.end(), 0ll))
#define Sort(v) (sort(v.begin(), v.end()))


constexpr ll INF = 1e9;
constexpr int MOD = 998244353;

// #define IO(NAME) \
//     cin.tie(0)->sync_with_stdio(0); \
//     if(fopen(NAME ".in","r")) freopen(NAME ".in","r",stdin), \
//     freopen(NAME ".out","w",stdout);

template <typename T1, typename T2> // cin >> pair<T1, T2>
istream &operator>>(istream &istream, pair<T1, T2> &p)
{
    return (istream >> p.first >> p.second);
}
 
template <typename T> // cin >> vector<T>
istream &operator>>(istream &istream, vector<T> &v)
{
    for (auto &it : v)
        cin >> it;
    return istream;
}
 
template <typename T1, typename T2> // cout << pair<T1, T2>
ostream &operator<<(ostream &ostream, const pair<T1, T2> &p)
{
    return (ostream << p.first << " " << p.second);
}
template <typename T> // cout << vector<T>
ostream &operator<<(ostream &ostream, const vector<T> &c)
{
    for (auto &it : c)
        cout << it << " ";
    return ostream;
}


// bitwise ops
// j is 0 based indexing 
// __builtin_ctzll() for long long and __ builtin_popcount()
#define LSB(S) ((S) & -(S))


ll LCM(int a, int b)
{
    return ((ll)a * b) / __gcd(a, b);
}

bool nCr_Parity(int n, int r){
    int i = 0;
    while(i <= 30){ // for 32 bit integers
        int x = 1<<i;
        if((x&r) > (x&n)) return 0;
        ++i;
    }
    return 1; // 1 is odd 
}

bool solve(){
    int n, m;
    cin >> n >> m;
    vi a(n), b(m);
    cin >> a >> b;
    int hi = (1 << m);
    vpii dp(hi, {0, 0});
    for(int mask = 0; mask < hi; ++mask){
        if(dp[mask].first == n) return true;
        for(int i = 0; i < m; ++i){
            if((mask & (1 << i)) == 0){
                int newmask = mask ^ (1 << i);
                pii newstate;
                if(dp[mask].second + b[i] == a[dp[mask].first]){
                    newstate = {dp[mask].first + 1, 0};
                }
                else{
                    newstate = {dp[mask].first, dp[mask].second + b[i]};
                }
                dp[newmask] = max(dp[newmask], newstate);
            }
        }
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << setprecision(10) << fixed;
    // IO(""); 

    puts(solve()? "YES" : "NO");
}
// when using printf, scanf for long long use %dll
// when using accumulate use 0ll if sum is long long

Compilation message

bank.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | // #define IO(NAME) \
      | ^

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 79 ms 8532 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 81 ms 8532 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 452 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 448 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 1 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 79 ms 8532 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 81 ms 8532 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2 ms 452 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 448 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 448 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 1 ms 340 KB Output is correct
31 Correct 85 ms 8532 KB Output is correct
32 Correct 89 ms 8532 KB Output is correct
33 Correct 93 ms 8532 KB Output is correct
34 Correct 90 ms 8532 KB Output is correct
35 Correct 87 ms 8532 KB Output is correct
36 Correct 85 ms 8532 KB Output is correct
37 Correct 85 ms 8532 KB Output is correct
38 Correct 85 ms 8532 KB Output is correct
39 Correct 4 ms 8532 KB Output is correct
40 Correct 93 ms 8532 KB Output is correct
41 Correct 86 ms 8532 KB Output is correct
42 Correct 99 ms 8532 KB Output is correct
43 Correct 90 ms 8532 KB Output is correct
44 Correct 87 ms 8532 KB Output is correct
45 Correct 4 ms 8532 KB Output is correct
46 Correct 99 ms 8532 KB Output is correct
47 Correct 85 ms 8532 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 82 ms 8532 KB Output is correct
50 Correct 83 ms 8416 KB Output is correct
51 Correct 88 ms 8424 KB Output is correct
52 Correct 86 ms 8532 KB Output is correct
53 Correct 92 ms 8532 KB Output is correct
54 Correct 84 ms 8532 KB Output is correct
55 Correct 82 ms 8532 KB Output is correct
56 Correct 90 ms 8532 KB Output is correct
57 Correct 85 ms 8516 KB Output is correct
58 Correct 85 ms 8532 KB Output is correct