oj.uz

Submission #124893

# Submission time Handle Problem Language Result Execution time Memory
124893 2019-07-04T05:41:54 Z 윤교준(#3050) Kitchen (BOI19_kitchen) C++14
100 / 100
 15 ms 764 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[sz(V)-2])
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
using namespace std;
typedef long long ll;
inline void fuk() { puts("Impossible"); exit(0); }

int D[90005];

int A[305], B[305];

int N, M, K, Asum;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> M >> K;
	if(M < K) fuk();
	for(int i = 1; i <= N; i++) {
		cin >> A[i];
		if(A[i] < K) fuk();
		Asum += A[i];
	}
	for(int i = 1; i <= M; i++) cin >> B[i];
	sort(B+1, B+M+1);
	fill(D+1, D+90005, -INF);

	for(int i = 1, sum = 0; i <= M; i++) {
		sum += B[i];
		for(int bsum = sum; B[i] <= bsum; bsum--) {
			int t = min(N*K, D[bsum-B[i]] + min(B[i], N));
			if(D[bsum] < t) D[bsum] = t;
		}
	}

	for(int i = Asum; i < 90005; i++)
		if(N*K == D[i]) {
			cout << i-Asum << endl;
			exit(0);
		}
	fuk();
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 632 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 764 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 2 ms 760 KB Output is correct
12 Correct 2 ms 760 KB Output is correct
13 Correct 2 ms 632 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 760 KB Output is correct
2 Correct 9 ms 732 KB Output is correct
3 Correct 7 ms 632 KB Output is correct
4 Correct 14 ms 736 KB Output is correct
5 Correct 15 ms 732 KB Output is correct
6 Correct 7 ms 632 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 764 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 2 ms 760 KB Output is correct
12 Correct 2 ms 760 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 11 ms 760 KB Output is correct
15 Correct 9 ms 732 KB Output is correct
16 Correct 7 ms 632 KB Output is correct
17 Correct 14 ms 736 KB Output is correct
18 Correct 15 ms 732 KB Output is correct
19 Correct 7 ms 632 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 2 ms 760 KB Output is correct
22 Correct 2 ms 760 KB Output is correct
23 Correct 2 ms 760 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 8 ms 760 KB Output is correct
26 Correct 9 ms 760 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 10 ms 632 KB Output is correct
30 Correct 14 ms 632 KB Output is correct