oj.uz

Submission #125947

# Submission time Handle Problem Language Result Execution time Memory
125947 2019-07-06T15:02:24 Z mechfrog88 Kitchen (BOI19_kitchen) C++14
9 / 100
 1000 ms 416 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 (temp.size() >= k){
		vector <ll> temp1;
		temp1 = temp;
		bool ok = true;
		ll left = 0;
		ll c = 0;
		while (c < arr.size() && ok){
			for (int z=0;z<k;z++){
				while (temp1[z] == 0 && z < temp1.size()){
					z++;
				}
				if (z == temp1.size()){
					ok = false;
					break;
				}
				temp1[z]--;
			}
			if (arr[c] < k){
				ok = false;
				break;
			} 
			left += arr[c]-k;
			c++;
		}
		ll s = 0;
		for (int z=0;z<temp1.size();z++){
			s += temp1[z];
		}
		if (s >= left && ok) ans = min(ans,s-left);
	}
	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);
	for (int z=0;z<n;z++){
		cin >> arr[z];
	}
	chef.resize(m);
	for (int z=0;z<m;z++){
		cin >> chef[z];
	}
	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:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (temp.size() >= k){
      ~~~~~~~~~~~~^~~~
kitchen.cpp:28:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (c < arr.size() && ok){
          ~~^~~~~~~~~~~~
kitchen.cpp:30:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (temp1[z] == 0 && z < temp1.size()){
                             ~~^~~~~~~~~~~~~~
kitchen.cpp:33:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (z == temp1.size()){
         ~~^~~~~~~~~~~~~~~
kitchen.cpp:47:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int z=0;z<temp1.size();z++){
                ~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 10 ms 376 KB Output is correct
10 Correct 14 ms 416 KB Output is correct
11 Incorrect 8 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1063 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 380 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 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 10 ms 376 KB Output is correct
10 Correct 14 ms 416 KB Output is correct
11 Incorrect 8 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -