oj.uz

Submission #606810

# Submission time Handle Problem Language Result Execution time Memory
606810 2022-07-26T08:40:35 Z jjiangly Bank (IZhO14_bank) C++14
100 / 100
 504 ms 12364 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()
#define siz(x) int(x.size())
#define ll long long
#define ar array
#define vt vector
#define inf INT_MAX
#define lnf LLONG_MAX

const int nxm = int(2e5) + 7;
int n, m, a[25], b[25];

namespace sub1 {
  void exe() {
    bool ok = false;
    function<void(int, int)> work = [&](int idx, int v) {
      if (idx == m) {
        ok = (v == a[0] ? true : ok);
        return;
      }
      work(idx + 1, v + b[idx]);
      work(idx + 1, v);
    };
    work(0, 0);
    cout << (ok ? "YES" : "NO") << "\n";
  }
};

namespace sub2 {
  void exe() {
    vt<int> p(m);
    iota(all(p), 0);
    bool ok = false;
    do {
      int cnt = 0, sum = 0;
      for (int i = 0; i < m; ++i) {
        sum += b[p[i]];
        if (sum == a[cnt]) {
          ++cnt;
          sum = 0;
        }
        if (cnt >= n) {
          break;
        }
      }
      if (cnt == n) {
        ok = true;
      }
    } while (next_permutation(all(p)));
    cout << (ok ? "YES" : "NO") << "\n";
  }
};

namespace sub4 {
  bool dp[1 << 21], ndp[1 << 21];
  void exe() {
    vt<vt<int>> f(20 * 1000 + 5);
    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];
        }
      }
      f[sum].push_back(mask);
    }
    dp[0] = true;
    int tot = 0;
    for (int i = 0; i < n; ++i) {
      tot += a[i];
      memset(ndp, false, sizeof(ndp));
      for (int v : f[tot - a[i]]) {
        ndp[v] = dp[v];
      }
      for (int j = 0; j < m; ++j) {
        for (int mask = 0; mask < (1 << m); ++mask) {
          if (mask >> j & 1 || !ndp[mask]) {
            continue;
          }
          ndp[mask ^ (1 << j)] = true;
        }
      }
      memset(dp, false, sizeof(dp));
      for (int v : f[tot]) {
        if (ndp[v]) {
          dp[v] = true;
        }
      }
    }
    bool ok = false;
    for (int mask = 0; mask < (1 << m); ++mask) {
      ok = dp[mask] ? true : ok;
    }
    cout << (ok ? "YES" : "NO") << "\n";
  }
};

int subtask() {
  if (n == 1) {
    return 1;
  } else if (n <= 10 && m <= 10) {
    return 2;
  }
  return 4;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < m; ++i) {
    cin >> b[i];
  }
  if (n > m) {
    cout << "NO\n";
  }
  if (subtask() == 1) {
    sub1::exe();
  } else if (subtask() == 2) {
    sub2::exe();
  } else {
    sub4::exe();
  }

  return 0;
}

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 212 KB Output is correct
2 Correct 77 ms 300 KB Output is correct
3 Correct 74 ms 300 KB Output is correct
4 Correct 73 ms 304 KB Output is correct
5 Correct 79 ms 316 KB Output is correct
6 Correct 78 ms 212 KB Output is correct
7 Correct 90 ms 332 KB Output is correct
8 Correct 89 ms 212 KB Output is correct
9 Correct 75 ms 308 KB Output is correct
10 Correct 74 ms 300 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4972 KB Output is correct
2 Correct 4 ms 5060 KB Output is correct
3 Correct 8 ms 5076 KB Output is correct
4 Correct 8 ms 4932 KB Output is correct
5 Correct 8 ms 4968 KB Output is correct
6 Correct 6 ms 5076 KB Output is correct
7 Correct 6 ms 4948 KB Output is correct
8 Correct 5 ms 4948 KB Output is correct
9 Correct 7 ms 5076 KB Output is correct
10 Correct 7 ms 5064 KB Output is correct
11 Correct 8 ms 4948 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 11 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 11 ms 328 KB Output is correct
9 Correct 10 ms 212 KB Output is correct
10 Correct 76 ms 212 KB Output is correct
11 Correct 77 ms 300 KB Output is correct
12 Correct 74 ms 300 KB Output is correct
13 Correct 73 ms 304 KB Output is correct
14 Correct 79 ms 316 KB Output is correct
15 Correct 78 ms 212 KB Output is correct
16 Correct 90 ms 332 KB Output is correct
17 Correct 89 ms 212 KB Output is correct
18 Correct 75 ms 308 KB Output is correct
19 Correct 74 ms 300 KB Output is correct
20 Correct 6 ms 4972 KB Output is correct
21 Correct 4 ms 5060 KB Output is correct
22 Correct 8 ms 5076 KB Output is correct
23 Correct 8 ms 4932 KB Output is correct
24 Correct 8 ms 4968 KB Output is correct
25 Correct 6 ms 5076 KB Output is correct
26 Correct 6 ms 4948 KB Output is correct
27 Correct 5 ms 4948 KB Output is correct
28 Correct 7 ms 5076 KB Output is correct
29 Correct 7 ms 5064 KB Output is correct
30 Correct 8 ms 4948 KB Output is correct
31 Correct 100 ms 11348 KB Output is correct
32 Correct 129 ms 10528 KB Output is correct
33 Correct 215 ms 11072 KB Output is correct
34 Correct 251 ms 11456 KB Output is correct
35 Correct 275 ms 12364 KB Output is correct
36 Correct 464 ms 11824 KB Output is correct
37 Correct 113 ms 12360 KB Output is correct
38 Correct 154 ms 11972 KB Output is correct
39 Correct 253 ms 9816 KB Output is correct
40 Correct 269 ms 11832 KB Output is correct
41 Correct 495 ms 11336 KB Output is correct
42 Correct 182 ms 10424 KB Output is correct
43 Correct 291 ms 12072 KB Output is correct
44 Correct 353 ms 12240 KB Output is correct
45 Correct 120 ms 11220 KB Output is correct
46 Correct 177 ms 12216 KB Output is correct
47 Correct 337 ms 11704 KB Output is correct
48 Correct 11 ms 212 KB Output is correct
49 Correct 11 ms 212 KB Output is correct
50 Correct 491 ms 9620 KB Output is correct
51 Correct 263 ms 10760 KB Output is correct
52 Correct 243 ms 9772 KB Output is correct
53 Correct 256 ms 9796 KB Output is correct
54 Correct 451 ms 9680 KB Output is correct
55 Correct 457 ms 9736 KB Output is correct
56 Correct 485 ms 9920 KB Output is correct
57 Correct 480 ms 9888 KB Output is correct
58 Correct 504 ms 9844 KB Output is correct