Submission #1311993

#TimeUsernameProblemLanguageResultExecution timeMemory
1311993nikoloz-chBank (IZhO14_bank)C++20
0 / 100
476 ms327680 KiB
#include <bits/stdc++.h> #define int int64_t using namespace std; void solve(){ int n, m; cin >> n >> m; vector<int> a(n), b(m); for(auto &i : a) cin >> i; for(auto &i : b) cin >> i; vector<vector<int>> sub; for(int i = 0; i < (1LL<<m); i++){ vector<int> cur; for(int j = 0; j < m; j++){ if(i & (1LL << j)){ cur.push_back(b[j]); } } sub.push_back(cur); } for(auto &i : sub){ int k = accumulate(i.begin(),i.end(),0); if(k == a[0]){ cout << "YES\n"; return; } } cout << "NO\n"; } signed main(){ cin.tie(0)->sync_with_stdio(0); int _; cin >> _; cout.tie(0); while(_--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...