Submission #783914

#	Time	Username	Problem	Language	Result	Execution time	Memory
783914		TheOpChicken	Kitchen (BOI19_kitchen)	C++17	0 / 100	40 ms	844 KiB

kitchen

#include <iostream>
using namespace std;

const int maxN = 350;
int dp[maxN*maxN], barr[maxN];

int main(){
	int n, m, k;
	cin >> n >> m >> k;

	bool pos = 1;
	int t1 = 0, t2 = 0;
	for (int i = 0; i < n; i++){
		int a;
		cin >> a;
		if (a < k) pos = 0;
		t2 += a;
	}

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

	if (!pos){
		cout << "Impossible" << endl;
		return 0;
	}

	for (int i = 1; i <= t2; i++) dp[i] = -1e15;
	dp[barr[0]] = min(barr[0], n);

	for (int i = 1; i < m; i++){
		for (int j = 0; j <= t2; j++){
			if (barr[i] <= j) dp[j] = max(dp[j], dp[j-barr[i]] + min(barr[i], n));
		}
	}

	for (int i = t1; i <= t2; i++){
		if (dp[i] >= n*k){
			cout << i-t1 << endl;
			return 0;
		}
	}

	cout << "Impossible" << endl;
}

Compilation message (stderr)

kitchen.cpp: In function 'int main()':
kitchen.cpp:30:40: warning: overflow in conversion from 'double' to 'int' changes value from '-1.0e+15' to '-2147483648' [-Woverflow]
   30 |  for (int i = 1; i <= t2; i++) dp[i] = -1e15;
      |                                        ^~~~~

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