# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13512 | 2015-02-22T13:30:48 Z | tncks0121 | Bank (IZhO14_bank) | C++14 | 155 ms | 892 KB |
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> #include <string.h> #include <memory.h> #include <math.h> #include <assert.h> #include <stack> #include <queue> #include <map> #include <set> #include <algorithm> #include <string> #include <functional> #include <vector> #include <deque> #include <utility> #include <bitset> #include <limits.h> #include <time.h> using namespace std; typedef long long ll; typedef unsigned long long llu; typedef double lf; typedef unsigned int uint; typedef long double llf; typedef pair<int, int> pii; const int Z = 20; int N, M, A[Z], B[Z]; bool visited[Z][1 << Z]; vector<int> S[Z]; void backtrack(int i, int state) { if (visited[i][state]) return; visited[i][state] = true; if (i == N) { puts("YES"); exit(0); } for (int e = 0; e < S[i].size(); e++) { int s = S[i][e]; if (state & s) continue; backtrack(i + 1, state | s); } } int main() { scanf("%d%d", &N, &M); for (int i = 0; i < N; i++) scanf("%d", A + i); for (int j = 0; j < M; j++) scanf("%d", B + j); for (int state = 0; state < (1 << M); state++) { int sum = 0; for (int i = 0; i < M; i++) if (state & (1 << i)) sum += B[i]; for (int i = 0; i < N; i++) if (sum == A[i]) S[i].push_back(state); } backtrack(0, 0); puts("NO"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 252 KB | Output is correct |
2 | Correct | 1 ms | 372 KB | Output is correct |
3 | Correct | 3 ms | 448 KB | Output is correct |
4 | Correct | 3 ms | 448 KB | Output is correct |
5 | Correct | 68 ms | 448 KB | Output is correct |
6 | Correct | 1 ms | 524 KB | Output is correct |
7 | Correct | 2 ms | 544 KB | Output is correct |
8 | Correct | 155 ms | 588 KB | Output is correct |
9 | Correct | 68 ms | 588 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 748 KB | Output is correct |
2 | Correct | 2 ms | 748 KB | Output is correct |
3 | Correct | 2 ms | 748 KB | Output is correct |
4 | Correct | 2 ms | 748 KB | Output is correct |
5 | Correct | 2 ms | 748 KB | Output is correct |
6 | Correct | 2 ms | 748 KB | Output is correct |
7 | Correct | 2 ms | 748 KB | Output is correct |
8 | Correct | 2 ms | 748 KB | Output is correct |
9 | Correct | 1 ms | 748 KB | Output is correct |
10 | Correct | 1 ms | 748 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 748 KB | Output is correct |
2 | Correct | 2 ms | 748 KB | Output is correct |
3 | Correct | 2 ms | 748 KB | Output is correct |
4 | Correct | 3 ms | 748 KB | Output is correct |
5 | Correct | 3 ms | 748 KB | Output is correct |
6 | Correct | 3 ms | 748 KB | Output is correct |
7 | Correct | 3 ms | 748 KB | Output is correct |
8 | Correct | 3 ms | 748 KB | Output is correct |
9 | Correct | 3 ms | 748 KB | Output is correct |
10 | Correct | 3 ms | 748 KB | Output is correct |
11 | Correct | 3 ms | 748 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 252 KB | Output is correct |
2 | Correct | 1 ms | 372 KB | Output is correct |
3 | Correct | 3 ms | 448 KB | Output is correct |
4 | Correct | 3 ms | 448 KB | Output is correct |
5 | Correct | 68 ms | 448 KB | Output is correct |
6 | Correct | 1 ms | 524 KB | Output is correct |
7 | Correct | 2 ms | 544 KB | Output is correct |
8 | Correct | 155 ms | 588 KB | Output is correct |
9 | Correct | 68 ms | 588 KB | Output is correct |
10 | Correct | 2 ms | 748 KB | Output is correct |
11 | Correct | 2 ms | 748 KB | Output is correct |
12 | Correct | 2 ms | 748 KB | Output is correct |
13 | Correct | 2 ms | 748 KB | Output is correct |
14 | Correct | 2 ms | 748 KB | Output is correct |
15 | Correct | 2 ms | 748 KB | Output is correct |
16 | Correct | 2 ms | 748 KB | Output is correct |
17 | Correct | 2 ms | 748 KB | Output is correct |
18 | Correct | 1 ms | 748 KB | Output is correct |
19 | Correct | 1 ms | 748 KB | Output is correct |
20 | Correct | 3 ms | 748 KB | Output is correct |
21 | Correct | 2 ms | 748 KB | Output is correct |
22 | Correct | 2 ms | 748 KB | Output is correct |
23 | Correct | 3 ms | 748 KB | Output is correct |
24 | Correct | 3 ms | 748 KB | Output is correct |
25 | Correct | 3 ms | 748 KB | Output is correct |
26 | Correct | 3 ms | 748 KB | Output is correct |
27 | Correct | 3 ms | 748 KB | Output is correct |
28 | Correct | 3 ms | 748 KB | Output is correct |
29 | Correct | 3 ms | 748 KB | Output is correct |
30 | Correct | 3 ms | 748 KB | Output is correct |
31 | Correct | 70 ms | 748 KB | Output is correct |
32 | Correct | 72 ms | 748 KB | Output is correct |
33 | Correct | 75 ms | 748 KB | Output is correct |
34 | Correct | 77 ms | 748 KB | Output is correct |
35 | Correct | 77 ms | 748 KB | Output is correct |
36 | Runtime error | 87 ms | 892 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
37 | Halted | 0 ms | 0 KB | - |