Submission #1291149

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291149		xosqedemrufo	은행 (IZhO14_bank)	C++20	100 / 100	264 ms	6724 KiB

bank

//Author RufatM
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<vector<pii>> vvp;
typedef vector<bool> vb;
typedef vector<string> vs;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define pb push_back
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define pf push_front
#define eb emplace_back
#define ff first
#define ss second
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)
#define mt19937_64 mt_rand(chrono::steady_clock::now().time_since_epoch().count())
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
template<typename T> bool isPrime(T n){if(n<=1)return false;if(n<=3)return true;if(n%2==0 or n%3==0)return false;for(T i=5;i*i<=n;i+=6)if(n%i==0 or n%(i+2)==0)return false;return true;}
const int MOD=1e9+7;
const int INF=1000000007;
const ll LINF=4e18;
const int LOG=21;
const int MAXN=1000005;
const int MAXM=100005;
int a[25],b[25];
signed main(){
    fastio;
    #ifndef ONLINE_JUDGE
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #endif
    int t=1;
    //cin >> t;
    while(t--){
        int n,m;
        cin >> n >> m;
        for(int i=0;i<n;i++){
            cin >> a[i];
        }
        for(int i=0;i<m;i++){
            cin >> b[i];
        }
        vi sum(1<<m);
        for(int mask=1;mask<(1<<m);mask++){
            int j = __builtin_ctz(mask);
            sum[mask] = sum[mask^(1<<j)] + b[j];
        }
        vi g[25];
        for(int i=0;i<n;i++){
            for(int mask=0;mask<(1<<m);mask++){
                if(sum[mask] == a[i]){
                    g[i].pb(mask);
                }
            }
        }
        vector<char> dp(1<<m), nx(1<<m);
        dp[0] = 1;
        for(int i=0;i<n;i++){
            fill(all(nx),0);
            for(int x=0;x<(1<<m);x++){
                if(!dp[x]){
                    continue;
                }
                for(int k=0;k<g[i].size();k++){
                    int y = g[i][k];
                    if((x & y) == 0){
                        nx[x|y] = 1;
                    }
                }
            }
            dp = nx;
        }
        for(int i=0;i<(1<<m);i++){
            if(dp[i]){
                YES;
                return 0;
            }
        }
        NO;
    }
}

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