# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
948885 | tnknguyen_ | Bank (IZhO14_bank) | C++14 | 103 ms | 17236 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 int long long
#define endl '\n'
#define MASK(k) (1LL<<k)
#define pii pair<int, int>
int n, m;
int a[30], b[30];
// ------------ SUBTASKS ------------
namespace SUB1{
bool ok(){
return (n == 1);
}
void solve(){
vector<int> f(1e3+5, 0);
f[0] = 1;
for(int i=1; i<=m; ++i){
for(int j=a[1]; j>=b[i]; --j){
f[j] |= f[j - b[i]];
}
}
cout<<(f[a[1]] ? "YES" : "NO");
//-----------------------------
exit(0);
}
# | 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... |