Submission #1272579

#TimeUsernameProblemLanguageResultExecution timeMemory
1272579kiteyuBank (IZhO14_bank)C++20
100 / 100
82 ms8624 KiB
#include<bits/stdc++.h> #define fi first #define se second using namespace std; using ll=long long; const int N=20; int n,m,a[N+5],b[N+5]; pair<int,int>dp[(1<<N)]; vector<int>g[N+5]; bool cmp(int x,int y){ return (int)g[x].size()>(int)g[y].size(); } int main(){ // freopen("bank.in","r",stdin); // freopen("bank.out","w",stdout); cin>>n>>m; for(int i=0;i<n;++i) cin>>a[i]; for(int i=0;i<m;++i) cin>>b[i]; for(int mask=0;mask<(1<<m);++mask) dp[mask]={-1,0}; dp[0]={0,0}; for(int mask=0;mask<(1<<m);++mask){ if(dp[mask].fi==-1) continue; if(dp[mask].fi==n) return cout<<"YES",0; // cout<<mask<<' '<<dp[mask].fi<<' '<<dp[mask].se<<":\n"; for(int j=0;j<m;++j) if(!((mask>>j)&1)){ int nw=(mask|(1<<j)); pair<int,int>cur={dp[mask].fi,dp[mask].se+b[j]}; if(cur.se>a[dp[mask].fi]) continue; if(cur.se==a[dp[mask].fi])cur.se=0,cur.fi++; // cout<<nw<<','<<cur.fi<<','<<cur.se<<'='<<dp[nw].fi<<','<<dp[nw].se<<'\n'; if(dp[nw].fi<cur.fi) dp[nw]=cur; } } cout<<"NO"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...