oj.uz

Submission #757794

# Submission time Handle Problem Language Result Execution time Memory
757794 2023-06-13T18:33:41 Z taher Kitchen (BOI19_kitchen) C++17
72 / 100
 1000 ms 11236 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 inf = 1000000000;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  bool found = false;
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> a(n);
  int tot = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    tot += a[i];
    if (a[i] < k) {
      found = true;
    }
  }
  vector<int> b(m);
  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }
  int ans = inf;
  vector<int> long_ids;
  vector<int> short_ids;
  for (int i = 0; i < m; i++) {
    if (b[i] >= n) {
      long_ids.push_back(i);
    } else {
      short_ids.push_back(i);
    }
  }
 
  ndp[0] = 1;
  for (int i = 0; i < (int) long_ids.size(); 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 == (int) short_ids.size()) {
      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 3 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 13 ms 712 KB Output is correct
13 Correct 122 ms 712 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 10072 KB Output is correct
2 Correct 62 ms 7832 KB Output is correct
3 Correct 220 ms 8712 KB Output is correct
4 Correct 114 ms 6000 KB Output is correct
5 Correct 214 ms 11236 KB Output is correct
6 Correct 64 ms 6524 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 596 KB Output is correct
2 Correct 22 ms 716 KB Output is correct
3 Correct 61 ms 796 KB Output is correct
4 Correct 115 ms 816 KB Output is correct
5 Correct 76 ms 924 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 3 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 13 ms 712 KB Output is correct
13 Correct 122 ms 712 KB Output is correct
14 Correct 99 ms 10072 KB Output is correct
15 Correct 62 ms 7832 KB Output is correct
16 Correct 220 ms 8712 KB Output is correct
17 Correct 114 ms 6000 KB Output is correct
18 Correct 214 ms 11236 KB Output is correct
19 Correct 64 ms 6524 KB Output is correct
20 Correct 5 ms 596 KB Output is correct
21 Correct 22 ms 716 KB Output is correct
22 Correct 61 ms 796 KB Output is correct
23 Correct 115 ms 816 KB Output is correct
24 Correct 76 ms 924 KB Output is correct
25 Correct 18 ms 596 KB Output is correct
26 Correct 22 ms 664 KB Output is correct
27 Correct 491 ms 1256 KB Output is correct
28 Correct 952 ms 2136 KB Output is correct
29 Correct 74 ms 564 KB Output is correct
30 Execution timed out 1061 ms 3032 KB Time limit exceeded
31 Halted 0 ms 0 KB -