oj.uz

Submission #757802

# Submission time Handle Problem Language Result Execution time Memory
757802 2023-06-13T18:37:22 Z taher Kitchen (BOI19_kitchen) C++17
72 / 100
 1000 ms 11260 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
 
using namespace std;
 
const int N = 300 * 300 + 5;
bool visited[305][N];
int ndp[N];

const int maxN = 305;
int a[maxN], b[maxN], long_ids[maxN], short_ids[maxN];
 
const int inf = 1000000000;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  bool found = false;
  int n, m, k;
  cin >> n >> m >> k;
  int tot = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    tot += a[i];
    if (a[i] < k) {
      found = true;
    }
  }
  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }
  int ans = inf;
  int ptr_long = 0, ptr_short = 0;

  for (int i = 0; i < m; i++) {
    if (b[i] >= n) {
      long_ids[ptr_long++] = i;
    } else {
      short_ids[ptr_short++] = i;
    }
  }
 
  ndp[0] = 1;
  for (int i = 0; i < ptr_long; i++) {
    for (int it = N - 1 - b[long_ids[i]]; it >= 0; it--) {
      if (ndp[it] > 0) {
        ndp[it + b[long_ids[i]]] = max(ndp[it + b[long_ids[i]]], ndp[it] + 1);
      }
    }
  }
  for (int i = 0; i < N; i++) {
    if (ndp[i] > 0) --ndp[i];
  }

  function<void(int, int)> Rec = [&](int i, int sum) {
    if (visited[i][sum]) {
      return ;
    }
    if (i == ptr_short) {
      if (sum >= max(n * k, tot)) {
        ans = min(ans, sum - tot);
        return ;
      }
      int ptr = tot - sum;
      while (ptr < N && sum + n * ndp[ptr] < n * k) ptr++;
      if (ptr < N && ndp[ptr] > 0) {
        ans = min(ans, sum + ptr - tot);
      }
      return ;
    }
    Rec(i + 1, sum + b[short_ids[i]]);
    Rec(i + 1, sum);
    visited[i][sum] = true;
    return ;
  };
 
  Rec(0, 0);
  if (ans < inf && !found) {
    cout << ans << '\n';
  } else {
    cout << "Impossible\n";
  }
  return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 14 ms 724 KB Output is correct
13 Correct 136 ms 844 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 10040 KB Output is correct
2 Correct 55 ms 7788 KB Output is correct
3 Correct 204 ms 8636 KB Output is correct
4 Correct 105 ms 6076 KB Output is correct
5 Correct 230 ms 11260 KB Output is correct
6 Correct 59 ms 6588 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 25 ms 724 KB Output is correct
3 Correct 64 ms 772 KB Output is correct
4 Correct 85 ms 728 KB Output is correct
5 Correct 104 ms 836 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 14 ms 724 KB Output is correct
13 Correct 136 ms 844 KB Output is correct
14 Correct 87 ms 10040 KB Output is correct
15 Correct 55 ms 7788 KB Output is correct
16 Correct 204 ms 8636 KB Output is correct
17 Correct 105 ms 6076 KB Output is correct
18 Correct 230 ms 11260 KB Output is correct
19 Correct 59 ms 6588 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 25 ms 724 KB Output is correct
22 Correct 64 ms 772 KB Output is correct
23 Correct 85 ms 728 KB Output is correct
24 Correct 104 ms 836 KB Output is correct
25 Correct 16 ms 652 KB Output is correct
26 Correct 17 ms 660 KB Output is correct
27 Correct 498 ms 1184 KB Output is correct
28 Correct 899 ms 2120 KB Output is correct
29 Correct 31 ms 588 KB Output is correct
30 Execution timed out 1090 ms 3872 KB Time limit exceeded
31 Halted 0 ms 0 KB -