oj.uz

Submission #862423

# Submission time Handle Problem Language Result Execution time Memory
862423 2023-10-18T08:10:12 Z iskhakkutbilim Kitchen (BOI19_kitchen) C++17
100 / 100
 23 ms 1116 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()

const int mod = 1e17;
const int N = 300;
int can[300 * 300 + 10];

int goal(vector<int> &srt, int k){
	int cnt = 0;
	while(true){
		sort(srt.rbegin(), srt.rend());
		if(srt[k-1] <= 0){
			break;
		}
		int mn = srt[k-1];
		for(int i = 0;i < k; i++){
			srt[i]-= mn;
		}
		cnt+= mn;
	}
	return cnt;
}

main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
   int n, m, k; 
	vector<int> a, b;
	cin >> n >> m >> k;
	a.resize(n);
	for(auto &e : a) cin >> e;
	b.resize(m);
	for(auto &e : b) cin >> e;
	if(k > m or *min_element(all(a)) < k){
		cout << "Impossible";
		return 0;
	}
	int sumX = accumulate(all(a), 0LL);
//	if(sumX > accumulate(all(b), 0LL)){
//		cout << "Impossible";
//		return 0;
//	}
	vector<int> B = b;
//	if(goal(B, k) < n * k){
//		cout << "Impossible";
//		return 0;
//	}

	for(int i = N*N; i >= 0; i--) can[i] = LLONG_MIN;
		can[0] = 0;
	for(int x : b){
		for(int i = N*N; i - x >= 0; i--){
			can[i] = max(can[i], can[i-x] + min(x, n));
		}
	}
	
	
	for(int i = sumX; i <= N*N; i++){
		if(can[i] >= n * k){
			cout << i-sumX;
			return 0;
		}
	}
//	cout << 't';
//	if(k == 1 && m > 15){
//		can[0] = 1;
//		for(int x : b){
//			for(int i = N*N; i - x >= 0; i--){
//				can[i]|= can[i-x];
//			}
//		}
//		int sumX = accumulate(all(a), 0LL);
//		if(goal(b, k) < n){
//			cout << "Impossible";
//			return 0;
//		}
//		for(int i = sumX; i <= N*N; i++){
//			if(can[i]){
//				cout << i-sumX;
//				return 0;
//			}
//		}
//		cout << "Impossible";
//		return 0;
//	}
	cout << "Impossible";
	return 0;
}

Compilation message

kitchen.cpp:29:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   29 | main(){
      | ^~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1116 KB Output is correct
2 Correct 17 ms 1112 KB Output is correct
3 Correct 22 ms 1116 KB Output is correct
4 Correct 22 ms 1116 KB Output is correct
5 Correct 23 ms 1116 KB Output is correct
6 Correct 15 ms 1116 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 3 ms 1116 KB Output is correct
4 Correct 4 ms 976 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 23 ms 1116 KB Output is correct
15 Correct 17 ms 1112 KB Output is correct
16 Correct 22 ms 1116 KB Output is correct
17 Correct 22 ms 1116 KB Output is correct
18 Correct 23 ms 1116 KB Output is correct
19 Correct 15 ms 1116 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct
21 Correct 4 ms 1116 KB Output is correct
22 Correct 3 ms 1116 KB Output is correct
23 Correct 4 ms 976 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 16 ms 1116 KB Output is correct
26 Correct 18 ms 1112 KB Output is correct
27 Correct 12 ms 1116 KB Output is correct
28 Correct 18 ms 976 KB Output is correct
29 Correct 19 ms 1116 KB Output is correct
30 Correct 22 ms 1112 KB Output is correct