oj.uz

답안 #76327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
76327 2018-09-12T15:26:46 Z win11905 은행 (IZhO14_bank) C++11
71 / 100
 90 ms 876 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 20;

int n, m;
int A[N], B[N];
vector<int> g[N];
bool chk[N][1<<N];

void dfs(int u, int st) {
    if(chk[u][st]) return;
    chk[u][st] = true;
    if(u == n) { puts("YES"); exit(0); }
    for(int v : g[u]) if(!(st & v)) dfs(u+1, st | v);
}

int main() {
    scanf("%d %d", &n, &m);
    for(int i = 0; i < n; ++i) scanf("%d", A+i);
    for(int i = 0; i < m; ++i) scanf("%d", B+i);
    for(int i = 0; i < (1<< m); ++i) {
        int sum = 0;
        for(int j = 0; j < m; ++j) if(i >> j & 1) sum += B[j];
        for(int j = 0; j < n; ++j) if(sum == A[j]) g[j].emplace_back(i);
    } 
    dfs(0, 0);
    puts("NO");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:20:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n; ++i) scanf("%d", A+i);
                                ~~~~~^~~~~~~~~~~
bank.cpp:21:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < m; ++i) scanf("%d", B+i);
                                ~~~~~^~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 71 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 672 KB Output is correct
8 Correct 70 ms 672 KB Output is correct
9 Correct 70 ms 672 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 672 KB Output is correct
2 Correct 2 ms 672 KB Output is correct
3 Correct 2 ms 672 KB Output is correct
4 Correct 2 ms 672 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 1 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 2 ms 672 KB Output is correct
10 Correct 2 ms 672 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 672 KB Output is correct
2 Correct 3 ms 672 KB Output is correct
3 Correct 3 ms 672 KB Output is correct
4 Correct 3 ms 672 KB Output is correct
5 Correct 3 ms 672 KB Output is correct
6 Correct 3 ms 672 KB Output is correct
7 Correct 3 ms 672 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 3 ms 672 KB Output is correct
10 Correct 3 ms 672 KB Output is correct
11 Correct 3 ms 672 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 71 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 672 KB Output is correct
8 Correct 70 ms 672 KB Output is correct
9 Correct 70 ms 672 KB Output is correct
10 Correct 2 ms 672 KB Output is correct
11 Correct 2 ms 672 KB Output is correct
12 Correct 2 ms 672 KB Output is correct
13 Correct 2 ms 672 KB Output is correct
14 Correct 2 ms 672 KB Output is correct
15 Correct 1 ms 672 KB Output is correct
16 Correct 2 ms 672 KB Output is correct
17 Correct 2 ms 672 KB Output is correct
18 Correct 2 ms 672 KB Output is correct
19 Correct 2 ms 672 KB Output is correct
20 Correct 3 ms 672 KB Output is correct
21 Correct 3 ms 672 KB Output is correct
22 Correct 3 ms 672 KB Output is correct
23 Correct 3 ms 672 KB Output is correct
24 Correct 3 ms 672 KB Output is correct
25 Correct 3 ms 672 KB Output is correct
26 Correct 3 ms 672 KB Output is correct
27 Correct 2 ms 672 KB Output is correct
28 Correct 3 ms 672 KB Output is correct
29 Correct 3 ms 672 KB Output is correct
30 Correct 3 ms 672 KB Output is correct
31 Correct 72 ms 736 KB Output is correct
32 Correct 73 ms 736 KB Output is correct
33 Correct 77 ms 736 KB Output is correct
34 Correct 79 ms 736 KB Output is correct
35 Correct 80 ms 736 KB Output is correct
36 Runtime error 90 ms 876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
37 Halted 0 ms 0 KB -