oj.uz

Submission #321041

# Submission time Handle Problem Language Result Execution time Memory
321041 2020-11-10T17:29:21 Z tushar_2658 Bank (IZhO14_bank) C++14
100 / 100
 534 ms 15588 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 21;

bool dp[maxn][1 << maxn];
int a[maxn], b[maxn];
int n, m;
vector<int> make[maxn];

int main(int argc, char const *argv[])
{
  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 mask = 0; mask < (1 << m); ++mask){
    int sum = 0;
    for(int i = 0; i < m; ++i){
      if((mask >> i) & 1){
        sum += b[i];
      }
    }
    for(int i = 0; i < n; ++i){
      if(a[i] == sum){
        make[i].push_back(mask);
      }
    }
  }
  for(int i = 0; i < n; ++i){
    for(int mask = 0; mask < (1 << m); ++mask){
      if((mask == 0 && i == 0) || (i > 0 && dp[i - 1][mask])){}
      else continue;
      for(auto nmask : make[i]){
        if((nmask & mask) == 0){
          dp[i][(nmask ^ mask)] = 1;
        }
      }
    }
  }
  bool good = 0;
  for(int i = 0; i < (1 << m); ++i){
    if(dp[n - 1][i]){
      good = 1;
      break;
    }
  }
  good ? cout << "YES" << '\n' : cout << "NO" << '\n';

  return 0;
}

Compilation message

bank.cpp: In function 'int main(int, const char**)':
bank.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |   scanf("%d %d", &n, &m);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |     scanf("%d", &a[i]);
      |     ~~~~~^~~~~~~~~~~~~
bank.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |     scanf("%d", &b[i]);
      |     ~~~~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 65 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 76 ms 1380 KB Output is correct
9 Correct 66 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 65 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 76 ms 1380 KB Output is correct
9 Correct 66 ms 364 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 72 ms 1124 KB Output is correct
32 Correct 157 ms 2532 KB Output is correct
33 Correct 84 ms 1636 KB Output is correct
34 Correct 89 ms 484 KB Output is correct
35 Correct 93 ms 612 KB Output is correct
36 Correct 110 ms 612 KB Output is correct
37 Correct 68 ms 364 KB Output is correct
38 Correct 74 ms 364 KB Output is correct
39 Correct 101 ms 5604 KB Output is correct
40 Correct 89 ms 364 KB Output is correct
41 Correct 111 ms 364 KB Output is correct
42 Correct 83 ms 3812 KB Output is correct
43 Correct 86 ms 1124 KB Output is correct
44 Correct 99 ms 364 KB Output is correct
45 Correct 72 ms 2788 KB Output is correct
46 Correct 82 ms 2276 KB Output is correct
47 Correct 104 ms 612 KB Output is correct
48 Correct 66 ms 1384 KB Output is correct
49 Correct 65 ms 364 KB Output is correct
50 Correct 203 ms 15584 KB Output is correct
51 Correct 92 ms 612 KB Output is correct
52 Correct 97 ms 3480 KB Output is correct
53 Correct 534 ms 8292 KB Output is correct
54 Correct 226 ms 15204 KB Output is correct
55 Correct 202 ms 15588 KB Output is correct
56 Correct 206 ms 15588 KB Output is correct
57 Correct 208 ms 14560 KB Output is correct
58 Correct 204 ms 14436 KB Output is correct