oj.uz

답안 #920995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920995 2024-02-03T08:44:16 Z shoryu386 Kitchen (BOI19_kitchen) C++17
29 / 100
 69 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
 
main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	int n, m, k; cin >> n >> m >> k;
	
	int buckets[n], balls[m];
	
	for (int x = 0; x < n; x++) cin >> buckets[x];
	for (int x = 0; x < m; x++) cin >> balls[x];
	
	#define IMP cout << "Impossible"; return 0;
	
	bool dead = false;
	for (int x = 0; x < n; x++){
		if (buckets[x] < k){
			dead = true;
		}
	}
	if (dead) {IMP;}
	
	if (m <= 15){
		
		int ans = LLONG_MAX/20;
		
		for (int bm = 0; bm < (1LL<<m); bm++){
			
			
			//if (__builtin_popcountll(bm) < k){
			//	continue;
			//}
			
			vector<int> chefs;
			
			for (int x = 0; x < m; x++){
				if (bm & (1<<x)){
					chefs.push_back(balls[x]);
				}
			}
			
			int chefsum = 0, bucketSum = 0;
			for (int x = 0; x < chefs.size(); x++) chefsum += chefs[x];
			for (int x = 0; x < n; x++) bucketSum += buckets[x]; 
			
			//can we support this?
			int needed[n]; for (int x = 0; x < n; x++) needed[x] = k;
		
			for (int x = 0; x < chefs.size(); x++){
				//for each chef, try and distribute
				for (int y = 0; y < n; y++){
					if (chefs[x] <= 0){
						break;
					}
					
					if (needed[y] > 0) needed[y]--, chefs[x]--;
				}
			}
			
			bool works = true;
			for (int x = 0; x < n; x++){
				if (needed[x] != 0){
					works = false;
				}
			}
			
			if (works && chefsum >= bucketSum){
				ans = min(ans, chefsum - bucketSum);
			}
		}
		
		if (ans == LLONG_MAX/20) {IMP;}
		else cout << ans;
	}
	else if (k == 1){
		//subtask 3
		#define BSMAX 100000
		//300^2
		
		bitset<BSMAX> bs;
		bs[0] = 1;
		
		for (int x = 0; x < m; x++){
			bs |= (bs << balls[x]);
		}
		
		int bucketsum = 0;
		for (int x = 0; x < n; x++){
			bucketsum += buckets[x];
		}
		
		int ans = -1;
		for (int x = bucketsum; x < BSMAX; x++){
			if (bs[x]){
				ans = x-bucketsum;
				break;
			}
		}
		
		if (ans == -1) cout << "Impossible";
		else cout << ans;
	}
}

Compilation message

kitchen.cpp:6:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    6 | main(){
      | ^~~~
kitchen.cpp: In function 'int main()':
kitchen.cpp:46:22: 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]
   46 |    for (int x = 0; x < chefs.size(); x++) chefsum += chefs[x];
      |                    ~~^~~~~~~~~~~~~~
kitchen.cpp:52:22: 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]
   52 |    for (int x = 0; x < chefs.size(); x++){
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 10 ms 488 KB Output is correct
12 Correct 11 ms 348 KB Output is correct
13 Incorrect 69 ms 464 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 10 ms 488 KB Output is correct
12 Correct 11 ms 348 KB Output is correct
13 Incorrect 69 ms 464 KB Output isn't correct
14 Halted 0 ms 0 KB -