제출 #1017077

#제출 시각아이디문제언어결과실행 시간메모리
1017077daviedu은행 (IZhO14_bank)C++17
71 / 100
1072 ms8680 KiB
#include <bits/stdc++.h> using namespace std; #define fastio ios_base::sync_with_stdio(0); cin.tie(0) #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define ll long long struct P{ ll x, y; }; void dbg_out() { cerr << endl; } template <typename H, typename... T> void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); } #define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); } signed main(){ fastio; int n, m; cin >> n >> m; vector<int> pay (n), notes (m); for (auto &a: pay) cin >> a; for (auto &a: notes) cin >> a; vector<pair<int, int>> dp ((1 << m), {-1, 0}); int a, b; bool ans=false; for (int i=0; i<n; i++){ for (int mask=0; mask<(1<<m); mask++){ for (int j=0; j<m; j++){ if (!(mask & (1 << j))) continue; tie(a, b) = dp[mask^(1<<j)]; if (a < i-1) continue; dp[mask] = {a, b+notes[j]}; if (a == i) break; else if (a == i-1 && b+notes[j] == pay[i]){ dp[mask] = {i, 0}; break; } } if (dp[mask].first == n-1) ans = true; } } cout << (ans? "YES" : "NO") << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...