oj.uz

Submission #126119

# Submission time Handle Problem Language Result Execution time Memory
126119 2019-07-07T05:30:43 Z mechfrog88 Kitchen (BOI19_kitchen) C++14
31 / 100
 1000 ms 3192 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
using namespace __gnu_pbds;
using namespace std;
 
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;

ll n,m,k;
ll ans = LLONG_MAX;
vector <ll> chef;
vector <ll> arr;

void func(vector <ll> temp,ll index){
	if (index == m && temp.size() >= k){
		bool ok = true;
		ll left = 0;
		ll c = 0;
		while (c < arr.size() && ok){
			sort(temp.rbegin(),temp.rend());
			ll count = 0;
			for (int z=0;count<k;z++){
				while (temp[z] == 0 && z < temp.size()){
					z++;
				}
				if (z == temp.size()){
					ok = false;
					break;
				}
				count++;
				temp[z]--;
			}
			if (arr[c] < k){
				ok = false;
				break;
			} 
			left += arr[c]-k;
			c++;
		}
		ll s = 0;
		for (int z=0;z<temp.size();z++){
			s += temp[z];
		}
		if (s >= left && ok) ans = min(ans,s-left);
		return;
	}
	if (index == m) return;
	func(temp,index+1);
	temp.push_back(chef[index]);
	func(temp,index+1);
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m >> k;
	arr.resize(n);
	ll s = 0;
	for (int z=0;z<n;z++){
		cin >> arr[z];
		s += arr[z];
	}
	chef.resize(m);
	for (int z=0;z<m;z++){
		cin >> chef[z];
	}
	if (k == 1){
		bitset<90001> dp[m];
		vector <bool> ok(90001,false);
		for (int z=0;z<m;z++){
			dp[z][0] = true;
		}
		dp[0][chef[0]] = true;
		ok[chef[0]] = true;
		for (int z=1;z<m;z++){
			for (int x=0;x<=90000;x++){
				if (dp[z-1][x] && x+chef[z] <= 90000) {
					dp[z][x+chef[z]] = true;
					ok[x+chef[z]] = true;
				}
			}
		}
		ll ans = -1;
		ll c = 0;
		for (int z=s;z<=90000;z++){
			if (ok[z]) {
				ans = z;
				break;
			}
			c++; 
		}
		if (ans == -1) cout << "Impossible" << endl;
		else cout << ans-s << endl;
		return 0; 
	}
	vector <ll> temp;
	func(temp,0);
	if (ans == LLONG_MAX){
		cout << "Impossible" << endl;
	} else {
		cout << ans << endl;
	}
}

Compilation message

kitchen.cpp: In function 'void func(std::vector<long long int>, ll)':
kitchen.cpp:22:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (index == m && temp.size() >= k){
                    ~~~~~~~~~~~~^~~~
kitchen.cpp:26:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (c < arr.size() && ok){
          ~~^~~~~~~~~~~~
kitchen.cpp:30:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (temp[z] == 0 && z < temp.size()){
                            ~~^~~~~~~~~~~~~
kitchen.cpp:33:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (z == temp.size()){
         ~~^~~~~~~~~~~~~~
kitchen.cpp:48:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int z=0;z<temp.size();z++){
                ~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 11 ms 376 KB Output is correct
10 Correct 13 ms 376 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 39 ms 384 KB Output is correct
13 Correct 284 ms 424 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 11 ms 376 KB Output is correct
10 Correct 13 ms 376 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 39 ms 384 KB Output is correct
13 Correct 284 ms 424 KB Output is correct
14 Incorrect 33 ms 3192 KB Output isn't correct
15 Halted 0 ms 0 KB -