# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285300 | BeanZ | Bank (IZhO14_bank) | C++14 | 1096 ms | 20380 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], dp[2000006];
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];
for (int i = 1; i < (1 << m); i++){
ll cost = 0;
for (int j = 0; j < m; j++){
if (i & (1 << j)){
cost += b[j];
}
}
if (cost <= 1000) choice[cost].push_back(i);
}
for (int i = 1; i < (1 << m); i++) dp[i] = -2;
dp[0] = -1;
bool flag = false;
for (int i = 0; i < n; i++){
for (int j = 1; j < (1 << m); j++){
for (auto k : choice[a[i]]){
if ((j & k) == k){
if (dp[j ^ k] == (i - 1)){
dp[j] = i;
}
}
}
//cout << dp[j] << " " << j << endl;
if (dp[j] == (n - 1)) 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... |