Submission #1131023

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131023		julia_08	Kitchen (BOI19_kitchen)	C++20	31 / 100	13 ms	328 KiB

kitchen

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 310;

int a[MAXN], aux[MAXN], b[MAXN];

int ans = 1e9;

int n, m, k;

int s_a = 0;

void check(int l, int r){

  int s_b = 0;

  for(int i=0; i<m; i++){
    aux[i] = b[i];

    if(l <= i && i <= r) s_b += aux[i];
  }

  if(s_a > s_b || k > r - l + 1) return;

  bool ok = true;

  int last = 0;

  for(int i=0; i<n; i++){

    while(aux[last] == 0) last ++;

    if(m - last < k){
      ok = false;
      break;
    }

    for(int j=last; j<last + k; j++) aux[j] --;

  }

  if(ok) ans = min(ans, s_b - s_a);
}

int main(){
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> m >> k;

  for(int i=0; i<n; i++){
    cin >> a[i];
    s_a += a[i];
  }

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

  sort(b, b + m);

  for(int i=0; i<n; i++){
    if(a[i] < k){
      cout << "Impossible\n";
      return 0;
    }
  }

  for(int l=0; l<m; l++){
    for(int r=l; r<m; r++){
      check(l, r);
    }
  }


  if(ans == 1e9){
    cout << "Impossible\n";

  } else cout << ans << "\n";

  return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 22 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28