CSES - Datatähti 2025 alku - Results
Submission details
Task:Tikut
Sender:OorigamiK
Submission time:2024-10-29 23:50:41 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
#50
#60
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 3, 4, 5, 6details
#2--1, 4, 5, 6details
#3--1, 4, 5, 6details
#4--1, 4, 5, 6details
#5--2, 5, 6details
#6--2, 5, 6details
#7--3, 5, 6details
#8--3, 5, 6details
#9--3, 5, 6details
#10--3, 5, 6details
#11--3, 5, 6details
#12--4, 5, 6details
#13--4, 5, 6details
#14--4, 5, 6details
#15--4, 5, 6details
#16--5, 6details
#17--5, 6details
#18--5, 6details
#19--5, 6details
#20--6details
#21--6details
#22--6details

Compiler report

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 | }
      | ^

Code

#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 details

Test 1

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

input
1 1
6

correct output

user output

0

Test 2

Group: 1, 4, 5, 6

Verdict:

input
5 10
4 8 6 2 7

correct output
5 4 2 2 2 1 1 1 1 1 

user output
(empty)

Test 3

Group: 1, 4, 5, 6

Verdict:

input
5 10
5 5 8 6 7

correct output
3 3 2 3 2 2 1 1 1 2 

user output
(empty)

Test 4

Group: 1, 4, 5, 6

Verdict:

input
5 10
8 7 9 6 10

correct output
4 4 3 3 2 2 1 2 2 1 

user output
(empty)

Test 5

Group: 2, 5, 6

Verdict:

input
1000 1071
3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ...

correct output
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

user output
(empty)

Test 6

Group: 2, 5, 6

Verdict:

input
1000 1500
3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ...

correct output
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

user output
(empty)

Test 7

Group: 3, 5, 6

Verdict:

input
1000 2
15 710 210 347 398 66 318 277 ...

correct output
994 994 

user output
(empty)

Test 8

Group: 3, 5, 6

Verdict:

input
1000 2
743 890 592 942 736 969 616 50...

correct output
498 496 

user output
(empty)

Test 9

Group: 3, 5, 6

Verdict:

input
1000 2
987 968 920 994 988 918 914 95...

correct output
500 500 

user output
(empty)

Test 10

Group: 3, 5, 6

Verdict:

input
1000 2
996 1000 998 998 999 997 997 9...

correct output
500 500 

user output
(empty)

Test 11

Group: 3, 5, 6

Verdict:

input
1000 2
501 501 501 501 501 501 501 50...

correct output
1 168 

user output
(empty)

Test 12

Group: 4, 5, 6

Verdict:

input
100 200
145 136 74 83 73 36 196 115 11...

correct output
194 190 189 183 182 181 181 17...

user output
(empty)

Test 13

Group: 4, 5, 6

Verdict:

input
100 200
157 110 168 155 192 107 146 15...

correct output
95 96 96 95 93 94 94 94 90 91 ...

user output
(empty)

Test 14

Group: 4, 5, 6

Verdict:

input
50 200
137 118 160 118 146 160 140 18...

correct output
98 98 98 96 90 91 88 88 84 86 ...

user output
(empty)

Test 15

Group: 4, 5, 6

Verdict:

input
100 200
147 174 186 148 155 128 158 18...

correct output
99 99 98 98 97 97 96 96 95 95 ...

user output
(empty)

Test 16

Group: 5, 6

Verdict:

input
1000 2000
928772177 816188227 216592201 ...

correct output
991676844 990940224 990685481 ...

user output
(empty)

Test 17

Group: 5, 6

Verdict:

input
1000 2000
665759876 597950008 615453266 ...

correct output
498801198 498681904 498504321 ...

user output
(empty)

Test 18

Group: 5, 6

Verdict:

input
500 2000
683288817 784230412 626685186 ...

correct output
497667621 498434895 495465990 ...

user output
(empty)

Test 19

Group: 5, 6

Verdict:

input
1000 2000
666667000 809309500 571572000 ...

correct output
499499500 499249250 498999000 ...

user output
(empty)

Test 20

Group: 6

Verdict:

input
100000 200000
861772559 734298084 983382252 ...

correct output
499973914 499985299 499985141 ...

user output
(empty)

Test 21

Group: 6

Verdict:

input
30000 200000
691834579 617419813 514778075 ...

correct output
499967533 499976270 499969810 ...

user output
(empty)

Test 22

Group: 6

Verdict:

input
100000 200000
820255000 960780000 741965000 ...

correct output
499995000 499992500 499990000 ...

user output
(empty)