# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528749 | Halym2007 | Bank (IZhO14_bank) | C++11 | 2 ms | 332 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 ff first
#define ss second
#define cont continue;
#define sz size()
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 100005;
void solve();
int n, m, b[N], jp, c, dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
freopen("bank.in", "r", stdin);
freopen("bank.out", "w", stdout);
cin >> n >> m;
if (n == 1) {
cin >> jp;
for (int i = 1; i <= m; ++i) cin >> b[i], c += b[i];
for (int i = 1; i <= m; ++i) {
for (int j = c; j >= 0; --j) {
if (dp[j] > 0 or j == 0) {
dp[j + b[i]] = 1;
}
}
}
cout << (dp[jp] != 0 ? "YES" : "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... |