# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285312 | BeanZ | Bank (IZhO14_bank) | C++14 | 152 ms | 16888 KiB |
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 ll long long
#define endl '\n'
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
vector<ll> choice[1005];
ll a[25], b[25];
pair<ll, ll> dp[1500000];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("VietCT.INP", "r")){
freopen("VietCT.INP", "r", stdin);
freopen("VietCT.OUT", "w", stdout);
}
ll 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];
bool flag = false;
for (int i = 1; i < (1 << m); i++){
for (int j = 0; j < m; j++){
if (i & (1 << j)){
pair<ll, ll> x = dp[i ^ (1 << j)];
x.second = x.second + b[j];
if (x.second == a[x.first]){
x.first++;
x.second = 0;
}
dp[i] = max(dp[i], x);
if (x.first == n) flag = true;
}
}
}
if (flag) cout << "YES";
else cout << "NO";
}
/*
*/
Compilation message (stderr)
# | 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... |