Submission #1133769

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133769		ChuanChen	Kitchen (BOI19_kitchen)	C++20	100 / 100	18 ms	584 KiB

kitchen

#include<bits/stdc++.h>
using namespace std;

const int lim = 301;

int n, m, k;
int sumA;
int dp[lim*lim];
//dp[c] = maior base possivel com subset de soma c

void solve(){

	cin >> n >> m >> k;
	for(int i = 1; i <= n; i++){
		int a; cin >> a;
		sumA+=a;
		if(a < k){
			cout << "Impossible\n";
			return;
		}
	}

	for(int i = 1; i < lim*lim; i++) dp[i] = -1;
	for(int i = 1; i <= m; i++){
		int b; cin >> b;
		for(int c = lim*lim-1; c-b >= 0; c--) if(dp[c-b] != -1){
			dp[c] = max(dp[c], dp[c-b]+min(b, n));
		}
	}
	for(int c = sumA; c < lim*lim; c++){
		if(dp[c] >= n*k){
			cout << c-sumA << '\n';
			return;
		}
	}
	cout << "Impossible\n";
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	clock_t Ostart;
	Ostart = clock();
	if(fopen("in", "r")){
		freopen("in", "r", stdin);
		freopen("out", "w", stdout);
		freopen("err", "w", stderr);
	}

	solve();

	cerr << fixed << setprecision(4) << "Exec time: "
	<< (double)(clock()-Ostart)/CLOCKS_PER_SEC << " secs.\n";
}

Compilation message (stderr)

kitchen.cpp: In function 'int main()':
kitchen.cpp:44:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |                 freopen("in", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~
kitchen.cpp:45:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |                 freopen("out", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~
kitchen.cpp:46:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |                 freopen("err", "w", stderr);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~

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