Submission #862357

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
862357	2023-10-18T05:57:35 Z	maks007	Kitchen (BOI19_kitchen)	C++14	30 / 100	67 ms	6192 KB

kitchen

// Bismi Allah
#include "bits/stdc++.h"
 
using namespace std;
 
#define int long long
 
int dp[1700][50][50];

signed main () {
	int n, m, k;
	cin >> n >> m >> k;
	int meal[n], chef[m], mealCopy[n];
	for(int i = 0; i < n; i ++) cin >> meal[i];
	for(int i = 0; i < m; i ++) cin >> chef[i];
	if(*min_element(meal, meal + n) < k) {
		cout << "Impossible";
		return 0;
	}
	if(m < k) {
		cout << "Impossible";
		return 0;
	}
	// if(k == 1) {
	// 	int szdp = accumulate(meal, meal + n, 0LL);
	// 	vector <int> dp((int)1e6, 0);
	// 	dp[0] = 1;
	// 	for(auto j : chef) {
	// 		for(int i = (int)1e6-1; i >= 0; i --) {
	// 			if(!dp[i]) continue;
	// 			dp[i+j] = 1;
	// 		}
	// 	}
	// 	int mn = 1e9;
	// 	for(int i = 0; i < dp.size(); i ++) {
	// 		if(dp[i] == 0) continue;
	// 		if(i < szdp) continue;
	// 		mn = min(mn, i-szdp);
	// 	}
	// 	if(mn == 1e9) cout << "Impossible\n";
	// 	else
	// 	cout << mn << "\n";
	// 	return 0;
	// }
	// int ans = 1e9;
	// for(int mask = 0; mask < (1 << m); mask ++) {
	// 	if(__builtin_popcount(mask) < k) continue;
	// 	vector <int> cook;
	// 	for(int i = 0; i < m; i ++) {
	// 		if(mask & (1 << i)) {
	// 			cook.push_back(chef[i]);
	// 		}
	// 	}
	// 	if(accumulate(cook.begin(), cook.end(), 0LL) < accumulate(meal, meal + n, 0LL)) continue;
	// 	int cnt = 0, other = 0;
	// 	for(int i = 0; i < cook.size(); i ++) {
	// 		if(cook[i] >= n) cnt ++;
	// 		else {
	// 			other += cook[i];
	// 		}
	// 	}
	// 	cnt += (other / n);
	// 	if(cnt >= k)
	// 		ans = min(ans, accumulate(cook.begin(), cook.end(), 0LL) - accumulate(meal, meal + n, 0LL));
	// }
	// if(ans == 1e9) cout << "Impossible";
	// else
	// cout << ans;
	int szdp = accumulate(meal, meal + n, 0);
	dp[0][0][0] = 1; 
	for(auto coin : chef) {
		for(int i = 1699; i >= 0; i --) {
			for(int full = 0; full < 41; full ++) {
				for(int rezerv = 0; rezerv < 41; rezerv ++) {
					if(dp[i][full][rezerv]) {
						if(coin >= n) dp[i+coin][full+1][rezerv] = 1;
						else {
							dp[i+coin][full+(rezerv + coin)/n][(rezerv + coin) % n] = 1;
						}
					}
				}
			}
		}
	}
	int ans = 1e9;
	for(int i = szdp; i < 1700; i ++) {
		for(int full = k; full < 50; full ++) {
			for(int rezerv = 0; rezerv < 50; rezerv ++) {
				if(dp[i][full][rezerv])
				ans = min(ans, i-szdp);
			}
		}
	}
	if(ans == 1e9) cout << "Impossible";
	else
	cout << ans;
	return 0;
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:13:24: warning: unused variable 'mealCopy' [-Wunused-variable]
   13 |  int meal[n], chef[m], mealCopy[n];
      |                        ^~~~~~~~

Subtask #1

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	348 KB	Output is correct
2	Correct	9 ms	856 KB	Output is correct
3	Correct	7 ms	348 KB	Output is correct
4	Correct	7 ms	348 KB	Output is correct
5	Correct	7 ms	516 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	9 ms	348 KB	Output is correct

Subtask #2

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	348 KB	Output is correct
2	Correct	9 ms	856 KB	Output is correct
3	Correct	7 ms	348 KB	Output is correct
4	Correct	7 ms	348 KB	Output is correct
5	Correct	7 ms	516 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	9 ms	348 KB	Output is correct
9	Runtime error	15 ms	2396 KB	Execution killed with signal 11
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	9 ms	604 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	53 ms	6192 KB	Output is correct
2	Correct	56 ms	4720 KB	Output is correct
3	Correct	67 ms	5064 KB	Output is correct
4	Correct	56 ms	5288 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct

Subtask #5

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	348 KB	Output is correct
2	Correct	9 ms	856 KB	Output is correct
3	Correct	7 ms	348 KB	Output is correct
4	Correct	7 ms	348 KB	Output is correct
5	Correct	7 ms	516 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	9 ms	348 KB	Output is correct
9	Runtime error	15 ms	2396 KB	Execution killed with signal 11
10	Halted	0 ms	0 KB	-