Submission #340715

#	Time	Username	Problem	Language	Result	Execution time	Memory
340715		talant117408	Bank (IZhO14_bank)	C++17	100 / 100	749 ms	54892 KiB

bank

/*
    Code written by Talant I.D.
*/
  
#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int salary[21], banknotes[21];
int dp[21][1 << 21], n, m;
vector <vector <int>> elig(21);

void rec(int ind, int mask){
    if(ind == n){
        dp[ind][mask] = 1;
        return ;
    }
    if(dp[ind][mask]) return;
    dp[ind][mask] = 1;
    for(int i = 0; i < sz(elig[ind]); i++){
        if((mask&elig[ind][i]) == 0){
            rec(ind+1, mask^elig[ind][i]);
        }
    }
}
    
int main(){
    do_not_disturb
    
    cin >> n >> m;
    
    for(int i = 0; i < n; i++){
        cin >> salary[i];
    }
    for(int i = 0; i < m; i++){
        cin >> banknotes[i];
    }
    
    for(int mask = 0; mask < (1<<m); mask++){
        int sum = 0;
        for(int i = 0; i < m; i++){
            if(mask&(1<<i)){
                sum += banknotes[i];
            }
        }
        for(int i = 0; i < n; i++){
            if(salary[i] == sum){
                elig[i].pb(mask);
            }
        }
    }
    
    rec(0, 0);
    int flag = 0;
    for(int mask = 0; mask < (1<<m); mask++){
        flag += dp[n][mask];
    }
    if(flag)
     cout << "YES";
    else cout << "NO";
    
    return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29