oj.uz

답안 #874266

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874266 2023-11-16T14:53:02 Z mertozel Kitchen (BOI19_kitchen) C++11
0 / 100
 31 ms 804 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void ex() {
	cout << "Impossible";
	exit(0);
}
int main() {

	int n, m, k;
	cin >> n >> m >> k;


	vector<int> dp (300 * 300 + 1, 0);
	vector<int> values(n), work_hours(m);
	dp[0] = 0;
	int sum = 0;
	for(int &i : values) {cin >> i; sum+=i;}
	for(int &i : work_hours) cin >> i;
	if(m < k) ex();


	for(int j = 0; j < m; j++) {

		for(int i = 300*300; i >= 1; i--) {
			if(i >= work_hours[j])
			dp[i] = max(dp[i-work_hours[j]] + min(n, work_hours[j]), dp[i]);
		}	
	}

	int ans = INT_MAX;

	for(int i = 0; i<=300*m; i++) {

		if(dp[i] >= n*k && i >= sum) ans = min(ans, i-sum);
	}

	if(ans == INT_MAX) ex();

	cout << ans;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Incorrect 1 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Incorrect 1 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 756 KB Output is correct
2 Correct 5 ms 804 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 5 ms 604 KB Output is correct
5 Incorrect 5 ms 604 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Incorrect 1 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -