Submission #656206

#TimeUsernameProblemLanguageResultExecution timeMemory
656206maks007Bank (IZhO14_bank)C++14
19 / 100
1 ms300 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; int a[n], b[m]; for(int i = 0; i < n; i ++) cin >> a[i]; for(int i = 0; i < m; i ++) cin >> b[i]; if(n == 1) { int dp[a[0] + 1]; memset(dp, 0, sizeof(dp)); dp[0] = 1; for(int i = 0; i < m; i ++) { for(int j = a[0]; j >= 0; j --) { if(j - b[i] < 0) break; dp[j] |= dp[j-b[i]]; } } if(dp[a[0]]) cout << "YES\n"; else cout << "NO\n"; } 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...