oj.uz

Submission #173729

# Submission time Handle Problem Language Result Execution time Memory
173729 2020-01-05T09:00:20 Z juggernaut Bank (IZhO14_bank) C++14
100 / 100
 253 ms 16600 KB 
#include <iostream>
#include <time.h>
#include <vector>

using namespace std;

#define ll long long
#define sz(x) (int)x.size()
#define pii pair < int, int >
#define endl "\n"
#define METH ios::sync_with_stdio(0); cin.tie(0);
#define BEGIN cout << "BEGIN" << endl;
#define END cout << "END" << endl;

const int mod = 1e9 + 7;                              /// ANOTHER HASH MOD: 228228227
const int prime = 29;                                  /// ANOTHER HASH PRIME: 997
const int INF = ((long long) 0xCAFEBABE - 1e9 - 4e8);

int n, m;
vector < short > a, b;
short pre[1 << 20];
bool dp[21][1 << 20];
vector<int>vec[10];
string int_to_bit(int x) {
  string res = "";
  while (x) {
    if (x & 1) {
      res += "1";
    } else {
      res += "0";
    }
    x >>= 1;
  }
  while (res.size() < m) {
    res += "0";
  }
  return res;
}

inline void read() {
  scanf("%d %d", &n, &m);
  a.resize(n + 1);
  b.resize(m + 1);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < m; i++) {
    scanf("%d", &b[i]);
  }
}

void calc(int mask, int cnt) {
  //cout << int_to_bit(mask) << " " << cnt << endl;
  if (cnt == n) {
    cout << "YES" << endl;
    exit(0);
  }
  if (dp[cnt][mask]) {
    return;
  }
  dp[cnt][mask] = 1;
  for(int to:vec[cnt]){
    if((mask&to)==to)calc(mask^to,cnt+1);
  }/*
  for (int sub = mask; sub != 0; sub = mask & (sub - 1)) {
    if (pre[sub] == a[cnt]) {
      calc(mask ^ sub, cnt + 1);
    }
  }*/
}

inline int solve() {
  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];
      }
    }
    pre[i] = sum;
    for(int cur=0;cur<n;cur++){
        if(sum==a[cur])vec[cur].push_back(i);
    }
  }
  calc((1 << m) - 1, 0);
  cout << "NO" << endl;
}

int main() {
  int t = 1;
  while (t--) {
    read();
    solve();
  }
}

Compilation message

bank.cpp: In function 'std::__cxx11::string int_to_bit(int)':
bank.cpp:34:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (res.size() < m) {
          ~~~~~~~~~~~^~~
bank.cpp: In function 'void read()':
bank.cpp:45:22: warning: format '%d' expects argument of type 'int*', but argument 2 has type '__gnu_cxx::__alloc_traits<std::allocator<short int> >::value_type* {aka short int*}' [-Wformat=]
     scanf("%d", &a[i]);
                      ^
bank.cpp:48:22: warning: format '%d' expects argument of type 'int*', but argument 2 has type '__gnu_cxx::__alloc_traits<std::allocator<short int> >::value_type* {aka short int*}' [-Wformat=]
     scanf("%d", &b[i]);
                      ^
bank.cpp: In function 'int solve()':
bank.cpp:87:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
bank.cpp: In function 'void read()':
bank.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &m);
   ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &a[i]);
     ~~~~~^~~~~~~~~~~~~
bank.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &b[i]);
     ~~~~~^~~~~~~~~~~~~

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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 84 ms 2424 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 84 ms 2388 KB Output is correct
9 Correct 84 ms 2504 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 84 ms 2424 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 84 ms 2388 KB Output is correct
9 Correct 84 ms 2504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 4 ms 504 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 380 KB Output is correct
31 Correct 85 ms 2460 KB Output is correct
32 Correct 87 ms 2532 KB Output is correct
33 Correct 92 ms 2424 KB Output is correct
34 Correct 94 ms 2552 KB Output is correct
35 Correct 97 ms 2476 KB Output is correct
36 Correct 106 ms 2424 KB Output is correct
37 Correct 86 ms 2424 KB Output is correct
38 Correct 88 ms 2424 KB Output is correct
39 Correct 92 ms 2424 KB Output is correct
40 Correct 94 ms 2552 KB Output is correct
41 Correct 106 ms 2404 KB Output is correct
42 Correct 98 ms 5576 KB Output is correct
43 Correct 93 ms 3064 KB Output is correct
44 Correct 101 ms 2424 KB Output is correct
45 Correct 86 ms 2424 KB Output is correct
46 Correct 88 ms 2424 KB Output is correct
47 Correct 101 ms 2396 KB Output is correct
48 Correct 84 ms 2424 KB Output is correct
49 Correct 84 ms 2424 KB Output is correct
50 Correct 106 ms 2552 KB Output is correct
51 Correct 94 ms 2640 KB Output is correct
52 Correct 94 ms 2552 KB Output is correct
53 Correct 95 ms 2424 KB Output is correct
54 Correct 106 ms 2424 KB Output is correct
55 Correct 106 ms 2456 KB Output is correct
56 Correct 106 ms 2428 KB Output is correct
57 Correct 253 ms 16600 KB Output is correct
58 Correct 105 ms 2528 KB Output is correct