# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
80907 | 2018-10-22T20:35:41 Z | farukkastamonuda | 은행 (IZhO14_bank) | C++14 | 196 ms | 18812 KB |
#include <bits/stdc++.h> #define fi first #define se second #define lo long long #define inf 1000000000 #define md 1000000007 #define li 2005 #define mpt make_pair #define pb push_back using namespace std; int n, m, A[22], B[22], sum[(1 << 20) + 5]; vector<int> v[22]; bool dp[22][(1 << 20) + 5]; void solve(int node, int msk){ if(node == n + 1){ printf("YES\n"); exit(0); } if(dp[node][msk] == true) return ; dp[node][msk]=true; for(int i = 0; i < (int)v[node].size(); i ++){ if(! (msk & v[node][i]) ) solve(node + 1, msk | v[node][i]); } } int main(){ scanf("%d %d", &n, &m); for(int i = 1; i <= n; i ++){ scanf("%d", &A[i]); } for(int i = 1; i <= m; i ++){ scanf("%d", &B[i]); } for(int i = 1; i < (1 << m) ; i ++){ for(int j = 0; j < m; j ++){ if(i&(1 << j)){ sum[i] = sum[i - (1 << j)] + B[j + 1]; break; } } } for(int i = 1; i <= n; i ++){ for(int j = 0; j < (1 << m) ; j ++){ if(A[i] == sum[j]){ v[i].pb(j); } } } solve(1, 0); printf("NO\n"); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 576 KB | Output is correct |
4 | Correct | 2 ms | 752 KB | Output is correct |
5 | Correct | 10 ms | 4596 KB | Output is correct |
6 | Correct | 2 ms | 4596 KB | Output is correct |
7 | Correct | 2 ms | 4596 KB | Output is correct |
8 | Correct | 11 ms | 4636 KB | Output is correct |
9 | Correct | 11 ms | 4636 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4636 KB | Output is correct |
2 | Correct | 2 ms | 4636 KB | Output is correct |
3 | Correct | 2 ms | 4636 KB | Output is correct |
4 | Correct | 2 ms | 4636 KB | Output is correct |
5 | Correct | 2 ms | 4636 KB | Output is correct |
6 | Correct | 2 ms | 4636 KB | Output is correct |
7 | Correct | 2 ms | 4636 KB | Output is correct |
8 | Correct | 2 ms | 4636 KB | Output is correct |
9 | Correct | 2 ms | 4636 KB | Output is correct |
10 | Correct | 2 ms | 4636 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4636 KB | Output is correct |
2 | Correct | 2 ms | 4636 KB | Output is correct |
3 | Correct | 2 ms | 4636 KB | Output is correct |
4 | Correct | 2 ms | 4636 KB | Output is correct |
5 | Correct | 2 ms | 4636 KB | Output is correct |
6 | Correct | 2 ms | 4636 KB | Output is correct |
7 | Correct | 2 ms | 4636 KB | Output is correct |
8 | Correct | 2 ms | 4636 KB | Output is correct |
9 | Correct | 2 ms | 4636 KB | Output is correct |
10 | Correct | 2 ms | 4636 KB | Output is correct |
11 | Correct | 2 ms | 4636 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 576 KB | Output is correct |
4 | Correct | 2 ms | 752 KB | Output is correct |
5 | Correct | 10 ms | 4596 KB | Output is correct |
6 | Correct | 2 ms | 4596 KB | Output is correct |
7 | Correct | 2 ms | 4596 KB | Output is correct |
8 | Correct | 11 ms | 4636 KB | Output is correct |
9 | Correct | 11 ms | 4636 KB | Output is correct |
10 | Correct | 2 ms | 4636 KB | Output is correct |
11 | Correct | 2 ms | 4636 KB | Output is correct |
12 | Correct | 2 ms | 4636 KB | Output is correct |
13 | Correct | 2 ms | 4636 KB | Output is correct |
14 | Correct | 2 ms | 4636 KB | Output is correct |
15 | Correct | 2 ms | 4636 KB | Output is correct |
16 | Correct | 2 ms | 4636 KB | Output is correct |
17 | Correct | 2 ms | 4636 KB | Output is correct |
18 | Correct | 2 ms | 4636 KB | Output is correct |
19 | Correct | 2 ms | 4636 KB | Output is correct |
20 | Correct | 2 ms | 4636 KB | Output is correct |
21 | Correct | 2 ms | 4636 KB | Output is correct |
22 | Correct | 2 ms | 4636 KB | Output is correct |
23 | Correct | 2 ms | 4636 KB | Output is correct |
24 | Correct | 2 ms | 4636 KB | Output is correct |
25 | Correct | 2 ms | 4636 KB | Output is correct |
26 | Correct | 2 ms | 4636 KB | Output is correct |
27 | Correct | 2 ms | 4636 KB | Output is correct |
28 | Correct | 2 ms | 4636 KB | Output is correct |
29 | Correct | 2 ms | 4636 KB | Output is correct |
30 | Correct | 2 ms | 4636 KB | Output is correct |
31 | Correct | 13 ms | 4704 KB | Output is correct |
32 | Correct | 17 ms | 4832 KB | Output is correct |
33 | Correct | 25 ms | 4832 KB | Output is correct |
34 | Correct | 33 ms | 4832 KB | Output is correct |
35 | Correct | 35 ms | 4832 KB | Output is correct |
36 | Correct | 57 ms | 4832 KB | Output is correct |
37 | Correct | 13 ms | 4832 KB | Output is correct |
38 | Correct | 18 ms | 4832 KB | Output is correct |
39 | Correct | 26 ms | 4832 KB | Output is correct |
40 | Correct | 32 ms | 4832 KB | Output is correct |
41 | Correct | 56 ms | 4832 KB | Output is correct |
42 | Correct | 29 ms | 8188 KB | Output is correct |
43 | Correct | 27 ms | 8188 KB | Output is correct |
44 | Correct | 43 ms | 8188 KB | Output is correct |
45 | Correct | 16 ms | 8188 KB | Output is correct |
46 | Correct | 22 ms | 8188 KB | Output is correct |
47 | Correct | 44 ms | 8188 KB | Output is correct |
48 | Correct | 10 ms | 8188 KB | Output is correct |
49 | Correct | 10 ms | 8188 KB | Output is correct |
50 | Correct | 54 ms | 8188 KB | Output is correct |
51 | Correct | 32 ms | 8188 KB | Output is correct |
52 | Correct | 32 ms | 8188 KB | Output is correct |
53 | Correct | 31 ms | 8188 KB | Output is correct |
54 | Correct | 55 ms | 8188 KB | Output is correct |
55 | Correct | 55 ms | 8188 KB | Output is correct |
56 | Correct | 55 ms | 8188 KB | Output is correct |
57 | Correct | 196 ms | 18812 KB | Output is correct |
58 | Correct | 53 ms | 18812 KB | Output is correct |