oj.uz

Submission #531715

# Submission time Handle Problem Language Result Execution time Memory
531715 2022-03-01T10:21:15 Z erke Bank (IZhO14_bank) C++11
100 / 100
 219 ms 82512 KB 
#include <bits/stdc++.h>
using namespace std;

int n, m;

namespace sub_1 {
  void solve() {
    int s; cin >> s;
    vector<int> a(m);
    for (auto &i : a) {
      cin >> i;
    }
    for (int mask = 0; mask < (1 << m); mask++) {
      int sum = 0;
      for (int i = 0; i < m; i++) {
        if ((mask >> i) & 1) {
          sum += a[i];
        }
      }
      if (sum == s) {
        cout << "YES" << '\n';
        return;
      }
    }
    cout << "NO" << '\n';
  }
}

namespace sub_2_3 {
  void solve() {
    if (n > m) {
      cout << "NO" << '\n';
      return;
    }
    vector<int> a(n + 1), b(m);
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
      cin >> b[i];
    }
    vector<int> sum(1 << m);
    for (int mask = 1; mask < (1 << m); mask++) {
      for (int i = 0; i < m; i++) {
        if ((mask >> i) & 1) {
          sum[mask] += b[i];
        }
      }
    }
    vector<vector<bool>> dp(n + 1, vector<bool>(1 << m));
    dp[0][0] = 1;
    for (int i = 1; i <= n; i++)
    for (int mask = 1; mask < (1 << m); mask++)
    for (int subm = mask; subm > 0; subm = (subm - 1) & mask) {
      if (dp[i - 1][mask ^ subm] && sum[subm] == a[i]) {
        dp[i][mask] = 1;
        if (i == n) {
          cout << "YES" << '\n';
          return;
        }
      }
    }
    cout << "NO" << '\n';
  }
}

namespace sub_4 {
  const int N = 20;

  int a[N], b[N];
  vector<int> vec[N];
  int cal[N][1 << N];

  void brute(int n, int mask) {
    if (n == -1) {
      cout << "YES" << '\n';
      exit(0);
    }
    if (cal[n][mask]) return;
    cal[n][mask] = 1;
    for (auto &i : vec[n]) {
      if ((mask & i) == i) {
        brute(n - 1, mask ^ i);
      }
    }
  }
  void solve() {
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
      cin >> b[i];
    }
    for (int mask = 1; mask < (1 << m); mask++) {
      int sum = 0;
      for (int i = 0; i < m; i++) {
        if ((mask >> i) & 1) sum += b[i];
      }
      for (int i = 0; i < n; i++) {
        if (sum == a[i]) vec[i].push_back(mask);
      }
    }
    memset(cal, 0, sizeof(cal));
    brute(n - 1, (1 << m) - 1);
    cout << "NO" << '\n';
  }
}

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  if (n == 1 && m <= 20) sub_1::solve();
  else if (n <= 20 && m <= 14) sub_2_3::solve();
  else sub_4::solve();
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 67 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 60 ms 204 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 332 KB Output is correct
2 Correct 23 ms 388 KB Output is correct
3 Correct 71 ms 384 KB Output is correct
4 Correct 105 ms 392 KB Output is correct
5 Correct 77 ms 376 KB Output is correct
6 Correct 37 ms 376 KB Output is correct
7 Correct 31 ms 332 KB Output is correct
8 Correct 17 ms 388 KB Output is correct
9 Correct 66 ms 388 KB Output is correct
10 Correct 59 ms 376 KB Output is correct
11 Correct 103 ms 388 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 67 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 60 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 53 ms 332 KB Output is correct
21 Correct 23 ms 388 KB Output is correct
22 Correct 71 ms 384 KB Output is correct
23 Correct 105 ms 392 KB Output is correct
24 Correct 77 ms 376 KB Output is correct
25 Correct 37 ms 376 KB Output is correct
26 Correct 31 ms 332 KB Output is correct
27 Correct 17 ms 388 KB Output is correct
28 Correct 66 ms 388 KB Output is correct
29 Correct 59 ms 376 KB Output is correct
30 Correct 103 ms 388 KB Output is correct
31 Correct 115 ms 82368 KB Output is correct
32 Correct 94 ms 82512 KB Output is correct
33 Correct 105 ms 82344 KB Output is correct
34 Correct 109 ms 82344 KB Output is correct
35 Correct 119 ms 82344 KB Output is correct
36 Correct 116 ms 82344 KB Output is correct
37 Correct 91 ms 82356 KB Output is correct
38 Correct 102 ms 82356 KB Output is correct
39 Correct 111 ms 82352 KB Output is correct
40 Correct 119 ms 82344 KB Output is correct
41 Correct 123 ms 82348 KB Output is correct
42 Correct 119 ms 82360 KB Output is correct
43 Correct 106 ms 82360 KB Output is correct
44 Correct 115 ms 82364 KB Output is correct
45 Correct 103 ms 82284 KB Output is correct
46 Correct 116 ms 82348 KB Output is correct
47 Correct 123 ms 82344 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 65 ms 204 KB Output is correct
50 Correct 119 ms 82324 KB Output is correct
51 Correct 126 ms 82348 KB Output is correct
52 Correct 219 ms 82400 KB Output is correct
53 Correct 107 ms 82388 KB Output is correct
54 Correct 120 ms 82372 KB Output is correct
55 Correct 122 ms 82372 KB Output is correct
56 Correct 127 ms 82352 KB Output is correct
57 Correct 156 ms 82356 KB Output is correct
58 Correct 108 ms 82364 KB Output is correct