oj.uz

Submission #794635

# Submission time Handle Problem Language Result Execution time Memory
794635 2023-07-26T17:21:17 Z nguyennehehe Bank (IZhO14_bank) C++14
19 / 100
 1000 ms 316 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 20;

int n, m, a[N], b[N];
int groups[N], v[N];
bool good;

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 backtrack(int id) {
  if (id == m) {
    fill(v, v + n, 0);
    for (int i = 0; i < m; ++i) {
      v[groups[i]] += b[i];
    }
    bool ok = true;
    for (int i = 0; i < n; ++i) {
      ok &= a[i] == v[i];
    }
    good |= ok;
    return;
  }
  for (int i = 0; i < n; ++i) {
    groups[id] = i;
    backtrack(id + 1);
  }
}

void sub2() {
  good = false;
  backtrack(0);
  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];
  if (n == 1) sub1();
  else if (n <= 10 && m <= 10) sub2();
}

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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 68 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 69 ms 292 KB Output is correct
9 Correct 68 ms 212 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 18 ms 316 KB Output is correct
5 Execution timed out 1076 ms 212 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 68 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 69 ms 292 KB Output is correct
9 Correct 68 ms 212 KB Output is correct
10 Correct 19 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 18 ms 316 KB Output is correct
14 Execution timed out 1076 ms 212 KB Time limit exceeded
15 Halted 0 ms 0 KB -