oj.uz

답안 #862359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862359 2023-10-18T05:59:27 Z maks007 Kitchen (BOI19_kitchen) C++14
72 / 100
 192 ms 8284 KB 
// 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;
	}
	if(*max_element(meal, meal + n) > 40 || *max_element(chef, chef + m) > 40){
		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;
		return 0;
	}
	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:35:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   for(int i = 0; i < dp.size(); i ++) {
      |                  ~~^~~~~~~~~~~
kitchen.cpp:57:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |    for(int i = 0; i < cook.size(); i ++) {
      |                   ~~^~~~~~~~~~~~~
kitchen.cpp:13:24: warning: unused variable 'mealCopy' [-Wunused-variable]
   13 |  int meal[n], chef[m], mealCopy[n];
      |                        ^~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8280 KB Output is correct
2 Correct 4 ms 8284 KB Output is correct
3 Correct 7 ms 8028 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 4 ms 8284 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8284 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8280 KB Output is correct
2 Correct 4 ms 8284 KB Output is correct
3 Correct 7 ms 8028 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 4 ms 8284 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8284 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 440 KB Output is correct
11 Correct 21 ms 1112 KB Output is correct
12 Correct 22 ms 1112 KB Output is correct
13 Correct 8 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 167 ms 8024 KB Output is correct
2 Correct 151 ms 8024 KB Output is correct
3 Correct 192 ms 8280 KB Output is correct
4 Correct 186 ms 8028 KB Output is correct
5 Correct 185 ms 8280 KB Output is correct
6 Correct 176 ms 8028 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 6444 KB Output is correct
2 Correct 52 ms 4692 KB Output is correct
3 Correct 50 ms 4844 KB Output is correct
4 Correct 50 ms 5164 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8280 KB Output is correct
2 Correct 4 ms 8284 KB Output is correct
3 Correct 7 ms 8028 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 4 ms 8284 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8284 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 440 KB Output is correct
11 Correct 21 ms 1112 KB Output is correct
12 Correct 22 ms 1112 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 167 ms 8024 KB Output is correct
15 Correct 151 ms 8024 KB Output is correct
16 Correct 192 ms 8280 KB Output is correct
17 Correct 186 ms 8028 KB Output is correct
18 Correct 185 ms 8280 KB Output is correct
19 Correct 176 ms 8028 KB Output is correct
20 Correct 59 ms 6444 KB Output is correct
21 Correct 52 ms 4692 KB Output is correct
22 Correct 50 ms 4844 KB Output is correct
23 Correct 50 ms 5164 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Incorrect 1 ms 344 KB Output isn't correct
26 Halted 0 ms 0 KB -