# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677975 | 2023-01-04T20:27:19 Z | Ahmed57 | Bank (IZhO14_bank) | C++14 | 67 ms | 164464 KB |
#include <bits/stdc++.h> using namespace std; vector<int> v[20]; int n,m;int ob[20],su[20]; long long dp[20][(1<<20)-1]; long long solve(int i,int mask){ if(i==n){ return 1; } if(dp[i][mask]!=-1)return dp[i][mask]; int ans = 0; for(auto j:v[i]){ if(j&mask==0){ ans|=solve(i+1,mask|j); if(ans==1)break; } } return dp[i][mask] = ans; } int main(){ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); cin>>n>>m; for(int i = 0;i<n;i++)cin>>ob[i]; for(int i = 0;i<m;i++)cin>>su[i]; for(int i = 0;i<n;i++){ for(int mask = 1;mask<(1<<m);mask++){ long long sum = 0; for(int j = 0;j<m;j++){ if(mask&(1<<j))sum+=su[j]; } if(sum==ob[i]){ v[i].push_back(mask); } } } memset(dp,-1,sizeof dp); cout<<(solve(0,0)?"YES\n":"NO\n"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 59 ms | 164428 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 60 ms | 164464 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 67 ms | 164448 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 59 ms | 164428 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |