oj.uz

Submission #90781

# Submission time Handle Problem Language Result Execution time Memory
90781 2018-12-24T11:27:35 Z mirbek01 Bank (IZhO14_bank) C++17
100 / 100
 216 ms 29212 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 1e3 + 2;

int n, m, a[N], b[N], sum[1<<20], used[21][1 << 20], cnt;
vector <int> vec[N];

void f(int i, int mask){
      cnt += 3;
      if(cnt >= 1e6){
            puts("NO");
            exit(0);
      }
      if(i == n){
            puts("YES");
            exit(0);
      }
      if(used[i][mask]) return;
      used[i][mask] = 1;
      for(int j = 0; j < vec[i].size(); j ++){
            int now = vec[i][j];
            if(mask & now) continue;
            f(i + 1, mask | now);
      }
}

int main(){
      cin >> n >> m;

      for(int i = 0; i < n; i ++){
            cin >> a[i];
      }

      for(int i = 0; i < m; i ++){
            cin >> b[i];
      }

      for(int mask = 0; mask < (1 << m); mask ++){
            for(int j = 0; j < m; j ++)
                  if(mask & (1 << j))
                        sum[mask] += b[j];
      }
      for(int i = 0; i < n; i ++){
            for(int mask = 0; mask < (1 << m); mask ++){
                  if(sum[mask] == a[i])
                        vec[i].push_back(mask);
            }
      }

      f(0, 0);

      puts("NO");
}
/***
4 20
5 5 5 6
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
***/

Compilation message

bank.cpp: In function 'void f(int, int)':
bank.cpp:22:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int j = 0; j < vec[i].size(); j ++){
                      ~~^~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 70 ms 4560 KB Output is correct
6 Correct 2 ms 4560 KB Output is correct
7 Correct 2 ms 4560 KB Output is correct
8 Correct 70 ms 4776 KB Output is correct
9 Correct 70 ms 4788 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4788 KB Output is correct
2 Correct 2 ms 4788 KB Output is correct
3 Correct 2 ms 4788 KB Output is correct
4 Correct 2 ms 4788 KB Output is correct
5 Correct 2 ms 4788 KB Output is correct
6 Correct 2 ms 4788 KB Output is correct
7 Correct 2 ms 4788 KB Output is correct
8 Correct 2 ms 4788 KB Output is correct
9 Correct 2 ms 4788 KB Output is correct
10 Correct 2 ms 4788 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4788 KB Output is correct
2 Correct 3 ms 4788 KB Output is correct
3 Correct 3 ms 4788 KB Output is correct
4 Correct 3 ms 4788 KB Output is correct
5 Correct 3 ms 4788 KB Output is correct
6 Correct 3 ms 4788 KB Output is correct
7 Correct 3 ms 4788 KB Output is correct
8 Correct 3 ms 4788 KB Output is correct
9 Correct 3 ms 4788 KB Output is correct
10 Correct 3 ms 4788 KB Output is correct
11 Correct 3 ms 4788 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 70 ms 4560 KB Output is correct
6 Correct 2 ms 4560 KB Output is correct
7 Correct 2 ms 4560 KB Output is correct
8 Correct 70 ms 4776 KB Output is correct
9 Correct 70 ms 4788 KB Output is correct
10 Correct 2 ms 4788 KB Output is correct
11 Correct 2 ms 4788 KB Output is correct
12 Correct 2 ms 4788 KB Output is correct
13 Correct 2 ms 4788 KB Output is correct
14 Correct 2 ms 4788 KB Output is correct
15 Correct 2 ms 4788 KB Output is correct
16 Correct 2 ms 4788 KB Output is correct
17 Correct 2 ms 4788 KB Output is correct
18 Correct 2 ms 4788 KB Output is correct
19 Correct 2 ms 4788 KB Output is correct
20 Correct 3 ms 4788 KB Output is correct
21 Correct 3 ms 4788 KB Output is correct
22 Correct 3 ms 4788 KB Output is correct
23 Correct 3 ms 4788 KB Output is correct
24 Correct 3 ms 4788 KB Output is correct
25 Correct 3 ms 4788 KB Output is correct
26 Correct 3 ms 4788 KB Output is correct
27 Correct 3 ms 4788 KB Output is correct
28 Correct 3 ms 4788 KB Output is correct
29 Correct 3 ms 4788 KB Output is correct
30 Correct 3 ms 4788 KB Output is correct
31 Correct 73 ms 4788 KB Output is correct
32 Correct 76 ms 4852 KB Output is correct
33 Correct 86 ms 4852 KB Output is correct
34 Correct 91 ms 4852 KB Output is correct
35 Correct 93 ms 4852 KB Output is correct
36 Correct 116 ms 4860 KB Output is correct
37 Correct 74 ms 4860 KB Output is correct
38 Correct 78 ms 4860 KB Output is correct
39 Correct 87 ms 4860 KB Output is correct
40 Correct 92 ms 4860 KB Output is correct
41 Correct 117 ms 4860 KB Output is correct
42 Correct 96 ms 14376 KB Output is correct
43 Correct 89 ms 14376 KB Output is correct
44 Correct 102 ms 14376 KB Output is correct
45 Correct 75 ms 14376 KB Output is correct
46 Correct 83 ms 14376 KB Output is correct
47 Correct 104 ms 14376 KB Output is correct
48 Correct 70 ms 14376 KB Output is correct
49 Correct 70 ms 14376 KB Output is correct
50 Correct 119 ms 14376 KB Output is correct
51 Correct 91 ms 14376 KB Output is correct
52 Correct 92 ms 14376 KB Output is correct
53 Correct 91 ms 14376 KB Output is correct
54 Correct 116 ms 14376 KB Output is correct
55 Correct 114 ms 14376 KB Output is correct
56 Correct 115 ms 14376 KB Output is correct
57 Correct 143 ms 29212 KB Output is correct
58 Correct 216 ms 29212 KB Output is correct