oj.uz

Submission #794983

# Submission time Handle Problem Language Result Execution time Memory
794983 2023-07-27T04:54:26 Z nguyennehehe Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 16720 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");
}

void maximize(int &x, int 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");
}

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];
  sub3();
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 708 KB Output is correct
5 Correct 52 ms 12624 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 53 ms 12600 KB Output is correct
9 Correct 52 ms 12624 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 852 KB Output is correct
2 Correct 8 ms 596 KB Output is correct
3 Correct 30 ms 980 KB Output is correct
4 Correct 45 ms 1324 KB Output is correct
5 Correct 31 ms 980 KB Output is correct
6 Correct 15 ms 708 KB Output is correct
7 Correct 11 ms 596 KB Output is correct
8 Correct 8 ms 596 KB Output is correct
9 Correct 24 ms 852 KB Output is correct
10 Correct 24 ms 832 KB Output is correct
11 Correct 43 ms 1236 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 708 KB Output is correct
5 Correct 52 ms 12624 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 53 ms 12600 KB Output is correct
9 Correct 52 ms 12624 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 21 ms 852 KB Output is correct
21 Correct 8 ms 596 KB Output is correct
22 Correct 30 ms 980 KB Output is correct
23 Correct 45 ms 1324 KB Output is correct
24 Correct 31 ms 980 KB Output is correct
25 Correct 15 ms 708 KB Output is correct
26 Correct 11 ms 596 KB Output is correct
27 Correct 8 ms 596 KB Output is correct
28 Correct 24 ms 852 KB Output is correct
29 Correct 24 ms 832 KB Output is correct
30 Correct 43 ms 1236 KB Output is correct
31 Execution timed out 1055 ms 16720 KB Time limit exceeded
32 Halted 0 ms 0 KB -