# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
885969 | Zero_OP | Bank (IZhO14_bank) | C++14 | 103 ms | 8648 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 range(v) begin(v), end(v)
#define compact(v) v.erase(unique(range(v)), end(v))
template<class T> bool minimize(T& a, T b){
if(a > b) return a = b, true;
return false;
}
template<class T> bool maximize(T& a, T b){
if(a < b) return a = b, true;
return false;
}
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
void Zero_OP(){
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
for(int i = 0; i < m; ++i){
cin >> b[i];
}
vector<pair<int, int>> dp(1 << m, make_pair(-1, -1));
dp[0] = {0, 0};
for(int mask = 0; mask < (1 << m); ++mask){
if(dp[mask].first == -1) continue;
if(dp[mask].first == n){
cout << "YES\n";
return;
}
// cout << mask << " : " << dp[mask].first << ' ' << dp[mask].second << '\n';
for(int i = 0; i < m; ++i){
if(mask >> i & 1 ^ 1){
int newMask = mask ^ (1 << i);
if(dp[mask].second + b[i] == a[dp[mask].first]){
maximize(dp[newMask], make_pair(dp[mask].first + 1, 0));
}
else{
maximize(dp[newMask], make_pair(dp[mask].first, dp[mask].second + b[i]));
}
}
}
}
cout << "NO\n";
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen("antuvu.inp", "r")){
freopen("antuvu.inp", "r", stdin);
freopen("antuvu.out", "w", stdout);
}
Zero_OP();
return 0;
}
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... |