oj.uz

Submission #795051

# Submission time Handle Problem Language Result Execution time Memory
795051 2023-07-27T05:41:56 Z nguyennehehe Bank (IZhO14_bank) C++14
100 / 100
 102 ms 8532 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 20;

int n, m, a[N], b[N];

void sub1() {
  bool ok = false;
  for (int s = 1; s < (1 << m); ++s) {
    int sum = 0;
    for (int i = 0; i < m; ++i) {
      if (s >> i & 1) sum += b[i];
    }

    ok |= sum == a[0];
  }

  cout << (ok ? "YES" : "NO");
}

void sub2() {
  bool good = false;
  sort(b, b + m);
  do {
    bool ok = true;
    for (int i = 0, j = 0; i < n; ++i) {
      int sum = 0;
      while (j < m && sum < a[i]) {
        sum += b[j];
        j += 1;
      }
      ok &= sum == a[i];
    }
    good |= ok;

    if (good) break;
  } while (next_permutation(b, b + m));
  cout << (good ? "YES": "NO");
}

template<typename T>
void maximize(T &x, T y) {
  if (x < y) x = y;
}

void sub3() {
  vector<int> sum(1 << m);
  for (int s = 1; s < (1 << m); ++s) {
    int cur = 0;
    for (int i = 0; i < m; ++i) {
      if (s >> i & 1) cur += b[i];
    }
    sum[s] = cur;
  }
  vector<vector<int>> dp(n, vector<int>(1 << m));
  for (int s = 0; s < (1 << m); ++s) {
    if (sum[s] == a[0]) dp[0][s] = 1;
  }
  for (int i = 1; i < n; ++i) {
    dp[i] = dp[i - 1];

    for (int s = 0; s < (1 << m); ++s) {
      int msk = ((1 << m) - 1) ^ s;
      for (int x = msk; ; x = (x - 1) & msk) {
        if (sum[x] == a[i]) {
          maximize(dp[i][s | x], dp[i - 1][s] + 1);
        }
        if (x == 0) break;
      }
    }
  }

  bool good = false;
  for (int s = 0; s < (1 << m); ++s) {
    if (dp[n - 1][s] == n) good = true;
  }
  cout << (good ? "YES": "NO");
}

void sub4() {
  vector<pair<int, int>> dp(1 << m, {-1, 0}); // (pp, left)
  dp[0] = {0, 0};
  for (int s = 0; s < (1 << m); ++s) {
    for (int i = 0; i < m; ++i) {
      if (s >> i & 1) continue;
      int sum = dp[s].second + b[i];
      int pp = dp[s].first;
      if (sum == a[pp]) {
        pp += 1;
        sum = 0;
      }

      maximize(dp[s | (1 << i)], {pp, sum});
    }
  }

  auto [x, y] = *max_element(dp.begin(), dp.end());
  if (x == n) cout << "YES";
  else cout << "NO";
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  cin >> n >> m;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < m; ++i) cin >> b[i];

  sub4();
}

Compilation message

bank.cpp: In function 'void sub4()':
bank.cpp:98:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   98 |   auto [x, y] = *max_element(dp.begin(), dp.end());
      |        ^

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 77 ms 8532 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 87 ms 8532 KB Output is correct
9 Correct 80 ms 8532 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 77 ms 8532 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 87 ms 8532 KB Output is correct
9 Correct 80 ms 8532 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 86 ms 8532 KB Output is correct
32 Correct 88 ms 8512 KB Output is correct
33 Correct 95 ms 8532 KB Output is correct
34 Correct 83 ms 8508 KB Output is correct
35 Correct 86 ms 8516 KB Output is correct
36 Correct 80 ms 8532 KB Output is correct
37 Correct 82 ms 8532 KB Output is correct
38 Correct 76 ms 8532 KB Output is correct
39 Correct 79 ms 8532 KB Output is correct
40 Correct 83 ms 8532 KB Output is correct
41 Correct 77 ms 8532 KB Output is correct
42 Correct 100 ms 8532 KB Output is correct
43 Correct 88 ms 8532 KB Output is correct
44 Correct 76 ms 8532 KB Output is correct
45 Correct 98 ms 8532 KB Output is correct
46 Correct 97 ms 8532 KB Output is correct
47 Correct 79 ms 8512 KB Output is correct
48 Correct 98 ms 8532 KB Output is correct
49 Correct 76 ms 8532 KB Output is correct
50 Correct 84 ms 8532 KB Output is correct
51 Correct 84 ms 8532 KB Output is correct
52 Correct 88 ms 8532 KB Output is correct
53 Correct 102 ms 8532 KB Output is correct
54 Correct 86 ms 8512 KB Output is correct
55 Correct 81 ms 8532 KB Output is correct
56 Correct 84 ms 8532 KB Output is correct
57 Correct 85 ms 8532 KB Output is correct
58 Correct 82 ms 8532 KB Output is correct