| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1325753 | ulvix | Bank (IZhO14_bank) | C++20 | 1098 ms | 143240 KiB |
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#ifdef ULVI
#include "debug.hpp"
#else
#define db(...)
#define dbv(v)
#define line()
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define enld endl
using namespace std;
using namespace __gnu_pbds;
typedef int ll;
typedef pair<ll,ll> pll;
const ll sz=2e5+100;
const ll lg=20;
const ll mod=1e9+7;
const ll inf=1e18;
template<class T>
using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(){
ll n,m;
cin>>n>>m;
vector<ll> a(n),b(m);
for(ll i=0;i<n;i++) cin>>a[i];
for(ll i=0;i<m;i++) cin>>b[i];
vector<ll> sum((1<<m)+5);
for(ll i=1;i<(1<<m);i++){
ll d=__builtin_ctzll(i);
sum[i]=sum[i^(1<<d)]+b[d];
}
map<ll,vector<ll>> mp;
for(ll i=0;i<(1<<m);i++) mp[sum[i]].push_back(i);
vector<ll> cur;
cur.push_back(0);
for(ll i=0;i<n;i++){
sort(all(cur));
cur.erase(unique(all(cur)),cur.end());
vector<ll> nxt;
for(ll mask1:cur){
for(ll mask2:mp[a[i]]){
if(mask1&mask2) continue;
nxt.push_back(mask1|mask2);
}
}
swap(nxt,cur);
}
if(cur.empty()) cout<<"NO\n";
else cout<<"YES\n";
}
int main(){
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t=1;
// cin>>t;
for(ll _=1;_<=t;_++){
// cout<<"Scenario #"<<_<<":\n";
solve();
}
}컴파일 시 표준 에러 (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... | ||||
