oj.uz

Submission #783894

# Submission time Handle Problem Language Result Execution time Memory
783894 2023-07-15T11:53:38 Z TheOpChicken Kitchen (BOI19_kitchen) C++17
41 / 100
 83 ms 109512 KB 
#include <iostream>
using namespace std;

const int maxN = 305, inf = 1e9;

int barr[maxN], dp[maxN][maxN*maxN]; 

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

	int total = 0;
	for (int i = 0; i < n; i++){
		int a;
		cin >> a;
		
		if (a < k){
			cout << "Impossible" << endl;
			return 0;
		}
		total += a;
	}

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

	for (int i = 0; i < m; i++){
		for (int j = 0; j < maxN*maxN; j++) dp[i][j] = -inf;
	}
	dp[0][barr[0]] = min(n, barr[0]);

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

	bool pos = 0;
	int ans;
	for (int i = total; i < maxN*maxN; i++){
		if (dp[m-1][i] >= n*k){
			pos = 1;
			ans = i;
			break;
		}
	}

	if (!pos) cout << "Impossible" << endl;
	else cout << ans-total << endl;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Incorrect 1 ms 980 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Incorrect 1 ms 980 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 95308 KB Output is correct
2 Correct 54 ms 82508 KB Output is correct
3 Correct 72 ms 109508 KB Output is correct
4 Correct 80 ms 109512 KB Output is correct
5 Correct 83 ms 105804 KB Output is correct
6 Correct 65 ms 76012 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14872 KB Output is correct
2 Correct 10 ms 14804 KB Output is correct
3 Correct 10 ms 14868 KB Output is correct
4 Correct 10 ms 14868 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Incorrect 1 ms 980 KB Output isn't correct
3 Halted 0 ms 0 KB -