| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 987644 | vjudge1 | Bank (IZhO14_bank) | C++17 | 1 ms | 604 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"
int n, m, a[25], b[25];
bool check(int x)
{
vector<int> dp(1005, 0);
dp[0] = 1;
for (int i = 1; i <= m; i++)
{
for (int j = x; j >= b[i]; j--)
{
if (dp[j - b[i]] != 0) dp[j] = 1;
}
}
return dp[x];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
int s = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
s = s + a[i];
}
for (int i = 1; i <= m; i++)
{
cin >> b[i];
}
int dem = 0;
for (int i = 1; i <= n; i++)
{
dem += check(a[i]);
}
if (dem == n && check(s) == true) cout << "YES";
else cout << "NO";
}| # | 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... | ||||
