Submission #858322

#	Time	Username	Problem	Language	Result	Execution time	Memory
858322		Trisanu_Das	Kitchen (BOI19_kitchen)	C++17	51 / 100	12 ms	796 KiB

kitchen

#include<bits/stdc++.h>
using namespace std;
const int MAXV  = 1e5 + 10;
 
int dp[MAXV];
int a[310], b[310];
int n, m, k;
int main(){
	scanf("%d %d %d", &n, &m, &k);
	int soma = 0, mina = 1e9 + 7;
	for(int i = 1; i <= n; i++){
		scanf("%d", &a[i]);
		mina = min(mina, a[i]);
		soma += a[i];
	}
	for(int i = 1; i <= m; i++) scanf("%d", &b[i]);
	if(mina < k){
		printf("Impossible\n");
		return 0;
	}
 
	if(k == 1){
		dp[0] = 1;
		for(int i = 1; i <= m; i++){
			for(int j = 90000 - b[i]; j >= 0; j--){
				dp[j + b[i]] |= dp[j];
			}
		}
		for(int i = soma; i <= 90000; i++){
			if(dp[i]){
				printf("%d\n", i -soma);
				return 0;
			}
		}
		printf("Impossible\n");
	}
	else{
		int ans = 1e9 + 7;
		for(int i = 0; i <(1<<m); i++){
			if(__builtin_popcount(i) < k) continue;
			int lsoma = 0;
			int chefmin = n*k;
			int cheftot = 0;
			for(int j = 1; j <= m; j++){
				if((1<<(j-1))&i) lsoma += b[j],cheftot += min(n,b[j]); 
			}
			if(cheftot >= chefmin && lsoma >= soma){
				ans = min(lsoma - soma, ans);
			}
		}
		if(ans == 1e9 + 7){
			printf("Impossible\n");
			return 0;
		}
		printf("%d\n", ans);
	}
}

Compilation message (stderr)

kitchen.cpp: In function 'int main()':
kitchen.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |  scanf("%d %d %d", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:12:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~
kitchen.cpp:16:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  for(int i = 1; i <= m; i++) scanf("%d", &b[i]);
      |                              ~~~~~^~~~~~~~~~~~~

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