| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 679223 | vjudge1 | Bank (IZhO14_bank) | C++17 | 315 ms | 90316 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 ull unsigned long long
#define oo 1e9
vector<vector<int>> convertToMask(20001);
int arr[20];
int dp[1 << 20][20];
int n;
bool rec(int mask, int i){
if(i == n){
return true;
}
if(dp[mask][i] != -1) return dp[mask][i];
for (int j : convertToMask[arr[i]])
{
if((mask & j) == 0){
if(rec(mask + j, i + 1)){
return dp[mask][i] = true;
}
}
}
return dp[mask][i] = false;
}
int main(){
memset(dp, -1, sizeof(dp));
int m; cin >> n >> m;
int banknotes[m];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
for (int i = 0; i < m; i++)
{
cin >> banknotes[i];
}
for (int mask = 1; mask < (1 << m); mask++)
{
int sum = 0;
for (int i = 0; i < m; i++)
{
if(mask & (1 << i)){
sum += banknotes[i];
}
}
convertToMask[sum].push_back(mask);
}
bool ans = rec(0, 0);
if(ans) 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... | ||||
