oj.uz

Submission #862304

# Submission time Handle Problem Language Result Execution time Memory
862304 2023-10-18T03:28:12 Z iskhakkutbilim Kitchen (BOI19_kitchen) C++17
0 / 100
 1 ms 348 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()


int n, m, k; 
vector<int> a, b;

main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
	cin >> n >> m >> k;
	a.resize(n);
	for(auto &e : a) cin >> e;
	b.resize(m);
	for(auto &e : b) cin >> e;
	vector<int> B = b;
	multiset<int> st;
	for(auto e : b) st.insert(e);
	
	sort(all(a));
	reverse(all(a));
	int ans = INT_MAX;
	for(int all = 0; all < (1<<m); all++){
		if(__builtin_popcount(all) < k) continue;
		int s = 0;
		b = B;
		for(auto x : a){
			int K = 0;
			for(int i = 0;i < m; i++){
				if(all & (1<<i) && b[i] > 0 && K < k){
					b[i]--, K++, x--;
				}
			}
			if(K != k){
				s = INT_MAX;
				break;
			}
			for(int i = 0;i < m; i++){
				if(all & (1<<i) && x > 0){
					if(b[i] >= x){
						b[i]-= x;
						x = 0;
					}else{
						x-= b[i];
						b[i] = 0;
					}
				}
			}
			if(x != 0){
				s = INT_MAX;
				break;
			}
		}
		
		
		for(int i = 0;i < m; i++){
			if(all & (1<<i)){
				s+= b[i];
			}
		}
		ans = min(ans, s);
	}
	if(ans >= INT_MAX){
		cout << "impossible";
		return 0;
	}
	cout << ans;
	return 0;
}

Compilation message

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

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -