Submission #826460

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
826460	2023-08-15 15:32:33	QwertyPi	Kitchen (BOI19_kitchen)	C++14	100 / 100	22 ms	1068 KiB

kitchen

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 300 + 11;
int a[MAXN], b[MAXN];
int dp[MAXN * MAXN]; // for fixed sum, maximise count
int32_t main(){
  int n, m, k; cin >> n >> m >> k;
  for(int i = 0; i < n; i++) cin >> a[i];
  for(int j = 0; j < m; j++) cin >> b[j];
  for(int i = 0; i < n; i++){
    if(a[i] < k){
      cout << "Impossible" << endl;
      return 0;
    }
  }
  int s_a = accumulate(a, a + n, 0LL);
  int s_b = 0, c_b = 0;
  for(int j = 0; j < m; j++) s_b += b[j], c_b += min(b[j], n);
  if(s_a > s_b || n * k > c_b){
    cout << "Impossible" << endl;
    return 0;
  }
  fill(dp + 1, dp + MAXN * MAXN, -(1LL << 60));
  for(int j = 0; j < m; j++){
    for(int i = MAXN * MAXN - 1 - b[j]; i >= 0; i--){
      dp[i + b[j]] = max(dp[i + b[j]], dp[i] + min(b[j], n));
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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