Submission #746041

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
746041	2023-05-21 10:43:52	vjudge1	Kitchen (BOI19_kitchen)	C++17	51 / 100	326 ms	108404 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>
using namespace std;
const int MAXN = 301;
const int MAXS = MAXN*MAXN+1000;
int dp[MAXN][MAXS], n, m, k;
void solve() {
  vector<int> a(n+1), b(m+1);
  int need = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    need += a[i];
  }
  for (int j = 1; j <= m; j++) {
    cin >> b[j];
  }
  
  int ans = INT_MAX;
  for (int bits = 0; bits < (1 << m); bits++) {
    int x = bits<<1;
    
    int sum = 0, chefs = 0, bad_chefs = 0, good_chefs = 0;
    for (int i = 1; i <= m; i++) {
      if ((x>>i)&1) {
        sum += b[i]; chefs++;
        if (b[i] < n) bad_chefs += b[i];
        else good_chefs++;
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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