# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90104 | 2018-12-20T09:05:59 Z | inom | Bank (IZhO14_bank) | C++14 | 5 ms | 592 KB |
#include<bits/stdc++.h> #include<ext/pb_ds/tree_policy.hpp> #include<ext/pb_ds/assoc_container.hpp> #define fi first #define se second #define new new228 #define pb push_back #define rank rank228 #define sz(c) (int)(c).size() #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() using namespace std; using namespace __gnu_pbds; #pragma GCC optimize("Ofast") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native") #pragma GCC optimize("fast-math") #pragma warning(disable : 4996) typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key(); const int N = 100100; const int INF = 1e15; const int MAXN = 4 * N; const int MOD = 998244353; int TN = 1; int n, m, x; int b[N]; void rec(int cur, int pos) { if (cur == x) { printf("YES\n"); exit(false); } if (cur > x) { return; } if (pos > m) { return; } rec(cur + b[pos], pos + 1); rec(cur, pos + 1); } void solve() { scanf("%d %d", &n, &m); scanf("%d", &x); for (int i = 1; i <= m; i++) { scanf("%d", &b[i]); } rec(0, 1); printf("NO\n"); return; } signed main() { // ios_base::sync_with_stdio(0); // in; out; // cin >> TN; while (TN--) { solve(); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 480 KB | Output is correct |
3 | Correct | 2 ms | 480 KB | Output is correct |
4 | Correct | 2 ms | 480 KB | Output is correct |
5 | Correct | 2 ms | 480 KB | Output is correct |
6 | Correct | 2 ms | 480 KB | Output is correct |
7 | Correct | 2 ms | 480 KB | Output is correct |
8 | Correct | 2 ms | 480 KB | Output is correct |
9 | Correct | 5 ms | 480 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 532 KB | Output is correct |
2 | Correct | 2 ms | 592 KB | Output is correct |
3 | Correct | 2 ms | 592 KB | Output is correct |
4 | Incorrect | 2 ms | 592 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 592 KB | Output is correct |
2 | Correct | 2 ms | 592 KB | Output is correct |
3 | Incorrect | 2 ms | 592 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 480 KB | Output is correct |
3 | Correct | 2 ms | 480 KB | Output is correct |
4 | Correct | 2 ms | 480 KB | Output is correct |
5 | Correct | 2 ms | 480 KB | Output is correct |
6 | Correct | 2 ms | 480 KB | Output is correct |
7 | Correct | 2 ms | 480 KB | Output is correct |
8 | Correct | 2 ms | 480 KB | Output is correct |
9 | Correct | 5 ms | 480 KB | Output is correct |
10 | Correct | 2 ms | 532 KB | Output is correct |
11 | Correct | 2 ms | 592 KB | Output is correct |
12 | Correct | 2 ms | 592 KB | Output is correct |
13 | Incorrect | 2 ms | 592 KB | Output isn't correct |
14 | Halted | 0 ms | 0 KB | - |