# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
758642 | 2023-06-15T03:29:07 Z | KN200711 | 은행 (IZhO14_bank) | C++14 | 1000 ms | 44716 KB |
# include <bits/stdc++.h> using namespace std; map<int, vector<int> > ck; int nd[1000001]; set<int> dp[21]; int main() { int N, M; scanf("%d %d", &N, &M); vector<int> A(N), B(M); int sum1 = 0, sum2 = 0; for(int i=0;i<N;i++) { scanf("%d", &A[i]); nd[A[i]] = 1; sum1 += A[i]; } for(int i=0;i<M;i++) { scanf("%d", &B[i]); sum2 += B[i]; } if(sum1 > sum2) { printf("NO\n"); return 0; } for(int i=0;i<(1 << M);i++) { int sum = 0; for(int k=0;k<M;k++) { if(i&(1 << k)) sum += B[k]; } if(sum <= 1e6 && nd[sum]) ck[sum].push_back(i); } dp[0].insert(0); for(int i=0;i<N;i++) { for(auto p : dp[i]) { for(auto k : ck[A[i]]) { if(p&k) continue; dp[i + 1].insert(p|k); } } } if(dp[N].size()) printf("YES\n"); else printf("NO\n"); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 2 ms | 212 KB | Output is correct |
5 | Correct | 72 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 75 ms | 712 KB | Output is correct |
9 | Correct | 74 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 308 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 2 ms | 212 KB | Output is correct |
4 | Correct | 2 ms | 212 KB | Output is correct |
5 | Correct | 2 ms | 212 KB | Output is correct |
6 | Correct | 2 ms | 212 KB | Output is correct |
7 | Correct | 2 ms | 304 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 2 ms | 212 KB | Output is correct |
5 | Correct | 72 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 75 ms | 712 KB | Output is correct |
9 | Correct | 74 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 308 KB | Output is correct |
11 | Correct | 1 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 1 ms | 212 KB | Output is correct |
14 | Correct | 1 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 212 KB | Output is correct |
16 | Correct | 1 ms | 212 KB | Output is correct |
17 | Correct | 0 ms | 212 KB | Output is correct |
18 | Correct | 1 ms | 212 KB | Output is correct |
19 | Correct | 1 ms | 212 KB | Output is correct |
20 | Correct | 1 ms | 212 KB | Output is correct |
21 | Correct | 1 ms | 212 KB | Output is correct |
22 | Correct | 2 ms | 212 KB | Output is correct |
23 | Correct | 2 ms | 212 KB | Output is correct |
24 | Correct | 2 ms | 212 KB | Output is correct |
25 | Correct | 2 ms | 212 KB | Output is correct |
26 | Correct | 2 ms | 304 KB | Output is correct |
27 | Correct | 1 ms | 212 KB | Output is correct |
28 | Correct | 1 ms | 212 KB | Output is correct |
29 | Correct | 1 ms | 212 KB | Output is correct |
30 | Correct | 0 ms | 212 KB | Output is correct |
31 | Correct | 74 ms | 360 KB | Output is correct |
32 | Correct | 170 ms | 1012 KB | Output is correct |
33 | Correct | 72 ms | 308 KB | Output is correct |
34 | Correct | 84 ms | 304 KB | Output is correct |
35 | Correct | 71 ms | 212 KB | Output is correct |
36 | Correct | 71 ms | 288 KB | Output is correct |
37 | Correct | 71 ms | 212 KB | Output is correct |
38 | Correct | 72 ms | 284 KB | Output is correct |
39 | Correct | 215 ms | 12620 KB | Output is correct |
40 | Correct | 71 ms | 280 KB | Output is correct |
41 | Correct | 0 ms | 212 KB | Output is correct |
42 | Correct | 78 ms | 572 KB | Output is correct |
43 | Correct | 72 ms | 288 KB | Output is correct |
44 | Correct | 72 ms | 212 KB | Output is correct |
45 | Correct | 74 ms | 548 KB | Output is correct |
46 | Correct | 72 ms | 316 KB | Output is correct |
47 | Correct | 73 ms | 212 KB | Output is correct |
48 | Correct | 77 ms | 460 KB | Output is correct |
49 | Correct | 72 ms | 280 KB | Output is correct |
50 | Correct | 749 ms | 44716 KB | Output is correct |
51 | Correct | 73 ms | 328 KB | Output is correct |
52 | Correct | 80 ms | 688 KB | Output is correct |
53 | Execution timed out | 1091 ms | 9648 KB | Time limit exceeded |
54 | Halted | 0 ms | 0 KB | - |