Submission #1107575

#	Time	Username	Problem	Language	Result	Execution time	Memory
1107575		vjudge1	Bank (IZhO14_bank)	C++17	71 / 100	1059 ms	89116 KiB

bank

#include <bits/stdc++.h>
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ff first
#define int long long
#define ss second
#define pb push_back
#define y1 zildjian

using namespace std;

const int N = 3e6+100;
const int INF = 1e18;
const int mod = 1e9+7;
const int dx[] = {-1,-1,0,1,1,1,0,-1,0};
const int dy[] = {0,1,1,1,0,-1,-1,-1,0};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int binpow (int a, int n){
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return (binpow (a, n-1)%mod * a%mod)%mod;
	else {
		int b = binpow (a, n/2) % mod;
		return (b%mod * b%mod)%mod;
	}
}

int n,m;
int a[N],b[N];
vector<int> g[N];

void dfs(int x, int mask){
    if(x>n){
        yes;
        exit(0);
    }
    for(auto tomsk:g[a[x]]){
        if(!(tomsk&mask)) dfs(x+1,mask+tomsk);
    }
}

void solve(){
    cin>>n>>m;
    for(int i = 1;i<=n;i++) cin>>a[i];
    for(int i = 1;i<=m;i++) cin>>b[i];
    for(int mask = 0;mask<(1<<m);mask++){
        int sum = 0;
        for(int i = 1;i<=m;i++){
            if(1&(mask>>(i-1))) sum+=b[i];
        }
        if(sum>1000) continue;
        g[sum].pb(mask);
    }
    dfs(1,0);
    no;
}   

signed main(){
    // freopen("floyd.in","r",stdin); 
    // freopen("floyd.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int T = 1;
    // cin>>T;
    for(int i = 1;i<=T;i++){
        // cout<<"Case "<<i<<": ";
        solve();
    }
}

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