Submission #1245157

#TimeUsernameProblemLanguageResultExecution timeMemory
1245157votranngocvyBank (IZhO14_bank)C++20
100 / 100
86 ms8520 KiB
#include <bits/stdc++.h> using namespace std; #define pii pair<int,int> #define fi first #define se second const int N = (1 << 20) + 5; int a[25],b[25]; pii dp[N]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,m; 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,-1}; dp[0] = {0,0}; for (int mask = 0; mask < (1 << m); mask++) { if (dp[mask].fi == -1) continue; if (dp[mask].fi == n) { cout << "YES\n"; return 0; } for (int i = 0; i < m; i++) { if (mask >> i & 1) continue; int nwMask = mask | (1 << i); pii nw = {-1,-1}; if (dp[mask].se + b[i] == a[dp[mask].fi]) nw = {dp[mask].fi + 1,0}; else if (dp[mask].se + b[i] < a[dp[mask].fi]) nw = {dp[mask].fi,dp[mask].se + b[i]}; if (nw.fi != -1) dp[nwMask] = max(dp[nwMask],nw); } } cout << "NO\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...