제출 #928767

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
928767	2024-02-17 05:18:17	UmairAhmadMirza	Kitchen (BOI19_kitchen)	C++14	21 / 100	29 ms	3164 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;
int const N=42;
int const inf=1e9;
bool dp[N*N][N*N];
int n,m,k;
int main(){
  cin>>n>>m>>k;
  int arr[n];
  int total=0;
  for(int i=0;i<n;i++){
    cin>>arr[i];
    total+=arr[i];
    if(arr[i]<k){
      cout<<"Impossible"<<endl;
      return 0;
    }
  }
  int chef[m];
  for(int i=0;i<m;i++)
    cin>>chef[i];
  dp[0][0]=1;
  for(int i=0;i<m;i++)
    for(int tot=(N*m);tot>=chef[i];tot--)
      for(int uni=min(chef[i],n);uni<=tot;uni++)
        dp[tot][uni]|=dp[tot-chef[i]][uni-min(chef[i],n)];
  for(int tot=total;tot<=(N*m);tot++)
    for(int uni=(k*n);uni<=tot;uni++)
      if(dp[tot][uni]){
        cout<<tot-total<<endl;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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