Submission #826453

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
826453	2023-08-15T15:21:31 Z	QwertyPi	Kitchen (BOI19_kitchen)	C++14	31 / 100	2 ms	432 KB

kitchen

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

const int MAXN = 300 + 11;
int a[MAXN], b[MAXN];
int32_t main(){
	int n, m, k; cin >> n >> m >> k;
	for(int i = 0; i < n; i++) cin >> a[i];
	for(int j = 0; j < m; j++) cin >> b[j];
	for(int i = 0; i < n; i++){
		if(a[i] < k){
			cout << "Impossible" << endl;
			return 0;
		}
	}
	int s_a = accumulate(a, a + n, 0LL);
	int s_b = 0, c_b = 0;
	for(int j = 0; j < m; j++) s_b += b[j], c_b += min(b[j], n);
	if(s_a > s_b || n * k > c_b){
		cout << "Impossible" << endl;
		return 0;
	}
	int ans = 1LL << 60;
	for(int mask = 0; mask < (1 << m); mask++){
		int s = 0, c = 0;
		for(int j = 0; j < m; j++){
			if(mask & (1 << j)) s += b[j], c += min(b[j], n);
		}
		if(s >= s_a && c >= k * n){
			ans = min(ans, s - s_a);
		}
	}

	assert(ans != (1LL << 60));
	cout << ans << endl;
}

Subtask #1

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	284 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	300 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct

Subtask #2

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	284 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	300 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	2 ms	212 KB	Output is correct
10	Correct	2 ms	300 KB	Output is correct
11	Correct	0 ms	304 KB	Output is correct
12	Correct	2 ms	212 KB	Output is correct
13	Correct	2 ms	212 KB	Output is correct

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	420 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	432 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	284 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	300 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	2 ms	212 KB	Output is correct
10	Correct	2 ms	300 KB	Output is correct
11	Correct	0 ms	304 KB	Output is correct
12	Correct	2 ms	212 KB	Output is correct
13	Correct	2 ms	212 KB	Output is correct
14	Runtime error	1 ms	420 KB	Execution killed with signal 6
15	Halted	0 ms	0 KB	-