# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1001459 | reginox | Bank (IZhO14_bank) | C++17 | 1058 ms | 8540 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>
#define ll long long
#define ld long double
#define all(v) begin(v), end(v)
#define pi pair<int, int>
#define vi vector<int>
#define task "test"
using namespace std;
const int maxn = 20;
int n, m, a[maxn], b[maxn];
bool dp[maxn][1<<maxn];
vector<int> cnt[maxn];
int main(){
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 0; i < m; i++) cin >> b[i];
for(int i = 0; i < 1<<m; i++){
int sum = 0;
for(int j = 0; j < m; j++){
if(i & (1<<j)) sum += b[j];
}
for(int j = 1; j <= n; j++){
if(sum == a[j]) cnt[j].push_back(i);
}
}
dp[0][0] = true;
for(int j = 1; j <= n; j++){
for(int i = 0; i < 1<<m; i++){
for(auto x:cnt[j]){
if(x > i) break;
if((x & i) == x){
dp[j][i] |= dp[j-1][i^x];
}
if(dp[n][i]){
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
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... |