Submission #677163

#	Time	Username	Problem	Language	Result	Execution time	Memory
677163		Khizri	Bank (IZhO14_bank)	C++17	100 / 100	231 ms	25932 KiB

bank

#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);

    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=15+5;
int t=1,n,m,cost[mxn],arr[mxn];
bool dp[1<<mxn][mxn];
void solve(){
    //freopen("bank.in","r",stdin);
    //freopen("bank.out","w",stdout);
    cin>>m>>n;
    for(int i=0;i<m;i++){
        cin>>cost[i];
    }
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    vector<int>vt[1005];
    for(int mask=1;mask<(1<<n);mask++){
        int sum=0;
        for(int i=0;i<n;i++){
            if(mask&(1<<i)){
                sum+=arr[i];
            }
        }
        if(sum<=1000){
            vt[sum].pb(mask);
        }
    }
    dp[0][0]=true;
    for(int mask=0;mask<1;mask++){
        for(int i=0;i<1;i++){
            for(int sub:vt[cost[i]]){
                if(!(sub&mask)){
                    dp[mask|sub][i]=true;
                    if(i==m-1){
                        cout<<"YES"<<endl;
                        return;
                    }
                }
            }
        }
    }
    for(int mask=1;mask<(1<<n);mask++){
        for(int i=0;i<m;i++){
            if(!dp[mask][i]) continue;
            for(int sub:vt[cost[i+1]]){
                if(!(sub&mask)){
                    dp[mask|sub][i+1]=true;
                    if(i+1==m-1){
                        cout<<"YES"<<endl;
                        return;
                    }
                }
            }
        }
    }
    cout<<"NO"<<endl;
}
int main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

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