oj.uz

Submission #667558

# Submission time Handle Problem Language Result Execution time Memory
667558 2022-12-01T17:18:31 Z I_love_Chou_Giang Bank (IZhO14_bank) C++14
100 / 100
 96 ms 8524 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], nxt[1 << 20], f[1 << 20];

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];

  memset(nxt, -1, sizeof(nxt));
  nxt[0] = 0;

  rep(mask, 1 << M) {
    rep(i, M) {
      if (~mask >> i & 1) {
        if (nxt[mask] == -1 || nxt[mask] == N) continue;
        int add = f[mask] + b[i];
        if (add < a[nxt[mask]]) {
          nxt[mask ^ (1 << i)] = nxt[mask];
          f[mask ^ (1 << i)] = add;
        } else if (add == a[nxt[mask]]) {
          nxt[mask ^ (1 << i)] = nxt[mask] + 1;
          f[mask ^ (1 << i)] = 0;
        }
      }
    }
  }

  bool ok = false;
  rep(mask, 1 << M) {
    ok = ok || nxt[mask] == N;
  }

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

  return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4424 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 63 ms 4436 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 81 ms 8476 KB Output is correct
9 Correct 74 ms 8408 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4424 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 63 ms 4436 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 81 ms 8476 KB Output is correct
9 Correct 74 ms 8408 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4420 KB Output is correct
15 Correct 3 ms 4436 KB Output is correct
16 Correct 2 ms 4436 KB Output is correct
17 Correct 2 ms 4436 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 3 ms 4436 KB Output is correct
21 Correct 3 ms 4436 KB Output is correct
22 Correct 3 ms 4424 KB Output is correct
23 Correct 3 ms 4308 KB Output is correct
24 Correct 3 ms 4424 KB Output is correct
25 Correct 3 ms 4424 KB Output is correct
26 Correct 3 ms 4436 KB Output is correct
27 Correct 3 ms 4436 KB Output is correct
28 Correct 3 ms 4436 KB Output is correct
29 Correct 3 ms 4436 KB Output is correct
30 Correct 3 ms 4488 KB Output is correct
31 Correct 84 ms 8416 KB Output is correct
32 Correct 94 ms 8444 KB Output is correct
33 Correct 68 ms 8396 KB Output is correct
34 Correct 63 ms 5412 KB Output is correct
35 Correct 63 ms 5448 KB Output is correct
36 Correct 63 ms 4564 KB Output is correct
37 Correct 62 ms 4692 KB Output is correct
38 Correct 63 ms 4436 KB Output is correct
39 Correct 66 ms 8388 KB Output is correct
40 Correct 62 ms 4436 KB Output is correct
41 Correct 63 ms 4528 KB Output is correct
42 Correct 85 ms 8432 KB Output is correct
43 Correct 64 ms 6852 KB Output is correct
44 Correct 63 ms 4428 KB Output is correct
45 Correct 82 ms 8428 KB Output is correct
46 Correct 74 ms 8504 KB Output is correct
47 Correct 62 ms 4576 KB Output is correct
48 Correct 72 ms 8236 KB Output is correct
49 Correct 63 ms 4536 KB Output is correct
50 Correct 77 ms 8524 KB Output is correct
51 Correct 63 ms 4736 KB Output is correct
52 Correct 67 ms 8396 KB Output is correct
53 Correct 96 ms 8384 KB Output is correct
54 Correct 84 ms 8512 KB Output is correct
55 Correct 77 ms 8424 KB Output is correct
56 Correct 76 ms 8508 KB Output is correct
57 Correct 77 ms 8464 KB Output is correct
58 Correct 76 ms 8504 KB Output is correct