# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1279573 | hanguyendanghuy | Bank (IZhO14_bank) | C++20 | 1 ms | 716 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fi first
#define se second
constexpr ll MAXN=2e6+5,MAXV=1e5,MOD=1e9+7,INF=1e18;
ll n,m,i,j,p,k,ans,dem,st,en,a[MAXN],b[MAXN],giatri[MAXN];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
freopen("test.inp","r",stdin);
freopen("test.out","w",stdout);
cin>>n>>m;
for(i=1;i<=n;i++) cin>>a[i];
for(i=0;i<m;i++) cin>>b[i];
for(ll mask=1;mask<(1<<m);mask++){
ll cnt=0;
for(j=0;j<m;j++)
if((mask>>j)&1) cnt+=b[j];
giatri[mask]=cnt;
}
vector<ll> dung,luu;
dung.pb(0);
for(i=1;i<=n;i++){
luu.clear();
for(ll mask=1;mask<(1<<m);mask++){
if(giatri[mask]==a[i]){
for(ll x:dung){
if((x|mask)==(x^mask)) luu.pb((x|mask));
}
}
}
dung=luu;
}
if(dung.size()) cout<<"YES";
else cout<<"NO";
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |