제출 #1107349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1107349		vjudge1	은행 (IZhO14_bank)	C++17	19 / 100	79 ms	76592 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],dp[N];
vector<int> ms[N];

bool go(int mask, int pos){
    if(pos == 1) return 1;
    bool check = 0;
    for(auto x:ms[pos-1]){
        if(!(mask&x)) check |= go(x,pos-1);
    }
    return check;
}

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 j = 1;j<=m;j++){
            if(1&(mask>>(j-1))) sum+=b[j];
        }
        for(int i = 1;i<=n;i++){
            if(sum == a[i] && go(mask,i)) ms[i].pb(mask);
        }
    }
    for(auto mask:ms[n]){
        // cout<<mask<<' ';
        if(go(mask,n)){
            yes;
            return;
        }
    }
    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: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29