Tikut

input/code.cpp: In function 'std::vector<int> recursive(std::vector<bool>, int)':
input/code.cpp:25:27: warning: unused variable 'bo' [-Wunused-variable]
   25 |                 for (bool bo : cuts) {
      |                           ^~
input/code.cpp:30:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |                 for (int i = 0; i < cuts.size(); i++) {
      |                                 ~~^~~~~~~~~~~~~
input/code.cpp:49:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (int i = 1; i < cuts.size() - 1; i++) {
      |                         ~~^~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int check(std::vector<int>, int)':
input/code.cpp:78:1: warning: no return statement in function returning non-void [-Wreturn-type]
   78 | }
      | ^

#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>

using namespace std;

int max(int a, int b) {
	if (a < b) {
		return b;
	}
	return a;
}

float maxF(float a, float b) {
	if (a < b) {
		return b;
	}
	return a;
}
std::vector<int> recursive(std::vector<bool> cuts, int m) {
	int min = 999;
	int max = 0;
	if (m == 0) {
		for (bool bo : cuts) {
			//std::cout << bo;
		}
		///std::cout << endl;
		int n = 0;
		for (int i = 0; i < cuts.size(); i++) {
			if (cuts[i]) {
				if (n < min) {
					min = n;
				}
				if (n > max) {
					max = n;
				}
				//std::cout << n << " " << min << " " << max << std::endl;
				n = 0;
			}
			else {
				n++;
			}
		}
		return { min,max };
	}
	min = 0;
	max = 999;
	for (int i = 1; i < cuts.size() - 1; i++) {
		if (!cuts[i] && !cuts[i-1]) {
			cuts.insert(cuts.begin() + i, true);
			std::vector<int> minMax=recursive(cuts,m-1);
			//std::cout << "minMax " << minMax[0] << " " << minMax[1] << endl;
			cuts.erase(cuts.begin() + i);
			if (minMax[0] > min) {
				min = minMax[0];
			}
			if (minMax[1] < max) {
				max = minMax[1];
			}
			//std::cout <<"min and max " << min << " " << max << endl;
		}
	}
	return { min,max };
}

int check(std::vector<int> numbers, int m) {
	int sum = 0;
	std::vector<bool> cuts;
	for (int num : numbers) {
		sum += num;
		for (int i = 0; i < num; i++) {
			cuts.push_back(false);
		}
		cuts.push_back(true);
	}

}

int main()
{
	std::vector<int> numbers;
	int n, m;
	int number;
	std::cin >> n >> m;
	//std::cout << n << " " << m << endl;
	for (int i = 0; i < n; i++) {
		std::cin >> number;
		numbers.push_back(number);

	}

	std::sort(numbers.begin(), numbers.end());

	for (int i = 0; i < m; i++) {
		int sum = 0;
		int numOfSplits = i + 1;
		std::vector<int> splittingNumbers;
		std::vector<float> splittingSize;
		int sumOfSplittingNums = 0;
		for (int j = n - 1; j >=max(0, n - 1 - i); j--) {
			sum += numbers[j];
			//std::cout << "calc sums jth number " << numbers[j] << endl;
		}
		//std::cout << "sum " << sum << std::endl;
		for (int j = n - 1; j >=max(0, n - 1 - i); j--) {
			//std::cout << "j " << j << endl;
			int splitNum = (numOfSplits) * float(numbers[j]) / sum;
			//std::cout << "splitNm " << splitNum<<" "<< float(numbers[j]) / (splitNum+1) << endl;
			sumOfSplittingNums += splitNum;
			splittingNumbers.push_back(splitNum);
			splittingSize.push_back(float(numbers[j]) / (splitNum + 1));
		}
		int dif = numOfSplits - sumOfSplittingNums;
		while (dif > 0) {
			int max = 0;
			int index = -1;
			for (int t = 0; t < int(splittingSize.size()); t++) {
				if (max < splittingSize[t]) {
					max = splittingSize[t];
					index = t;
				}
			}
			//std::cout << "index " << index<<" "<<splittingNumbers[index]<<" "<< float(numbers[n - 1 - index]) / (1 + splittingNumbers[index]) << " " << n - 1 - index<<" "<<splittingSize.size()<<" "<<splittingNumbers.size() << endl;
			splittingNumbers[index] += 1;
			splittingSize[index] = float(numbers[n - 1 - index]) / (1 + splittingNumbers[index]);
			//std::cout << "splits left "<<dif-1<<" " << splittingSize[index] << endl;
			dif--;
		}
		int max = 0;
		int min = 999999;
		for (int t = 0; t < int(splittingSize.size()); t++) {
			//std::cout << "splitSize "<<t<<" " << splittingSize[t] << endl;
			if (max < ceil(splittingSize[t])) {
				max = ceil(splittingSize[t]);
			}
			if (min > floor(splittingSize[t])) {
				min = floor(splittingSize[t]);
			}
			if (min == 0) {
				//std::cout << "ERROR"<<endl;
			}
		}
		for (int t = n - 1 - int(splittingSize.size()); t >= 0; t--) {
			if (max < numbers[t]) {
				max = numbers[t];
			}
			if (min > numbers[t]) {
				min = numbers[t];
			}
			//std::cout << "min check " << numbers[t] << " " << min << endl;
			//std::cout << "max check " << numbers[t] << " " << max << endl;


		}
		//std::cout << "abs diff " << max - min<<" "<<max<<" "<<min << endl;
		std::cout << endl;
		std::vector<bool> cuts;
		for (int num : numbers) {
			for (int j = 0; j < num; j++) {
				cuts.push_back(false);
			}
			cuts.push_back(true);
		}
		std::vector<int> minMax = recursive(cuts, i+1);
		//std::cout << "rec " << minMax[1] - minMax[0] << " " << minMax[0] << " " << minMax[1] << endl;
		if (i < m - 1) {
			//std::cout << max - min << " ";
			std::cout << minMax[1] - minMax[0] << " ";
		}
		else {
			//std::cout << max - min;
			std::cout << minMax[1] - minMax[0];

		}
	}
	std::cout << "\n";
}

Test 1

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

Test 2

Group: 1, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED