oj.uz

Submission #667536

# Submission time Handle Problem Language Result Execution time Memory
667536 2022-12-01T17:03:32 Z I_love_Chou_Giang Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 10196 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;

#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

#define R_EP(i, a, b, s) for (int i = (a); (s) > 0 ? i < (b) : i > (b); i += (s))
#define R_EP1(e) R_EP(i, 0, e, 1)
#define R_EP2(i, e) R_EP(i, 0, e, 1)
#define R_EP3(i, b, e) R_EP(i, b, e, 1)
#define R_EP4(i, b, e, s) R_EP(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define R_EPC(...) GET5(__VA_ARGS__, R_EP4, R_EP3, R_EP2, R_EP1)
#define rep(...) R_EPC(__VA_ARGS__)(__VA_ARGS__)
#define trav(x, a) for (auto x : a) 

template<typename T> inline bool umax(T&x, const T& y) { if (x >= y) return false; x = y; return true; }
template<typename T> inline bool umin(T&x, const T& y) { if (x <= y) return false; x = y; return true; }

const int MOD = int(1e9) + 7;

int N, M, a[20], b[20], prefix[20];
bool can[1 << 20], can2[1 << 20];
vt<int> f[20005];

int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);

  cin >> N >> M;
  rep(i, N) cin >> a[i];
  rep(i, M) cin >> b[i];

  prefix[0] = a[0];
  rep(i, 1, N) prefix[i] = prefix[i - 1] + a[i];

  rep(mask, 1 << M) {
    int sum = 0;
    rep(i, M) {
      if (mask >> i & 1) sum += b[i];
    }
    f[sum].pb(mask);
    assert(sum <= 20000);
  }

  trav(mask, f[prefix[0]]) can[mask] = true;

  rep(i, N - 1) {
    trav(mask, f[prefix[i]]) {
      if (!can[mask]) continue;
      trav(mask2, f[prefix[i + 1]]) {
        if ((mask2 & mask) == mask) {
          can2[mask2] = true;
        }
      }
    }
    rep(mask, 1 << M) can[mask] = can2[mask], can2[mask] = false;
  }

  bool ok = false;
  trav(mask, f[prefix[N - 1]]) umax(ok, can[mask]);

  cout << (ok ? "YES" : "NO") << "\n";

  return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 0 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 63 ms 7056 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 66 ms 7276 KB Output is correct
9 Correct 61 ms 6800 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 0 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 63 ms 7056 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 66 ms 7276 KB Output is correct
9 Correct 61 ms 6800 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 800 KB Output is correct
12 Correct 1 ms 800 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 800 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 800 KB Output is correct
17 Correct 1 ms 796 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 2 ms 852 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 3 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 2 ms 928 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 64 ms 9292 KB Output is correct
32 Correct 98 ms 8532 KB Output is correct
33 Correct 67 ms 8932 KB Output is correct
34 Correct 76 ms 9296 KB Output is correct
35 Correct 73 ms 10196 KB Output is correct
36 Correct 71 ms 9812 KB Output is correct
37 Correct 70 ms 10060 KB Output is correct
38 Correct 69 ms 9912 KB Output is correct
39 Execution timed out 1091 ms 7672 KB Time limit exceeded
40 Halted 0 ms 0 KB -