oj.uz

Submission #667538

# Submission time Handle Problem Language Result Execution time Memory
667538 2022-12-01T17:05:45 Z I_love_Chou_Giang Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 10240 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;
        }
      }
    }
    trav(mask, f[prefix[i + 1]]) 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 1 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 71 ms 7116 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 69 ms 7196 KB Output is correct
9 Correct 72 ms 6704 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 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 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 2 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 980 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 1 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 71 ms 7116 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 69 ms 7196 KB Output is correct
9 Correct 72 ms 6704 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 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 2 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 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 74 ms 7948 KB Output is correct
32 Correct 108 ms 8476 KB Output is correct
33 Correct 82 ms 9000 KB Output is correct
34 Correct 78 ms 9340 KB Output is correct
35 Correct 80 ms 10240 KB Output is correct
36 Correct 81 ms 9932 KB Output is correct
37 Correct 76 ms 8176 KB Output is correct
38 Correct 75 ms 7836 KB Output is correct
39 Execution timed out 1097 ms 7720 KB Time limit exceeded
40 Halted 0 ms 0 KB -