This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n'
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
const int MAXN = 20;
int n,m;
int a[MAXN], b[MAXN], dp[1<<MAXN], dp1[1<<MAXN];
signed main() {
freopen("bank.in","r",stdin);
freopen("bank.out","w",stdout);
cin >> n >> m;
FOR(i,0,n) cin >> a[i];
FOR(i,0,m) cin >> b[i];
FOR(s,0,1<<m) dp[s] = dp1[s] = -INF;
dp[0] = -1;
dp1[0] = 0;
FOR(s,0,1<<m) {
FOR(j,0,m) {
if (s&(1<<j)) {
if (dp[s^(1<<j)] == n-1 || dp[s^(1<<j)] == -INF) continue;
int x = dp[s^(1<<j)];
int rem = dp1[s^(1<<j)]+b[j];
if (rem > a[dp[s^(1<<j)]+1]) continue;
if (dp1[s^(1<<j)]+b[j] == a[dp[s^(1<<j)]+1]) {
x++; rem = 0;
}
if (x > dp[s]) {
dp[s] = x;
dp1[s] = rem;
}
else if (x == dp[s]) dp1[s] = rem;
}
}
}
FOR(s,0,1<<m) {
if (dp[s] == n-1 && dp1[s] == 0) {
cout << "YES";
return 0;
}
}
cout << "NO";
}
Compilation message (stderr)
bank.cpp: In function 'int main()':
bank.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | freopen("bank.in","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bank.cpp:31:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
31 | freopen("bank.out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |