CSES - Datatähti 2025 alku - Results
Submission details
Task:Tikut
Sender:DLPS
Submission time:2024-11-02 16:42:04 +0200
Language:C++ (C++20)
Status:READY
Result:27
Feedback
groupverdictscore
#1ACCEPTED7
#2ACCEPTED8
#3ACCEPTED12
#40
#50
#60
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 3, 4, 5, 6details
#2ACCEPTED0.01 s1, 4, 5, 6details
#3ACCEPTED0.01 s1, 4, 5, 6details
#4ACCEPTED0.08 s1, 4, 5, 6details
#5ACCEPTED0.24 s2, 5, 6details
#6ACCEPTED0.48 s2, 5, 6details
#7ACCEPTED0.07 s3, 5, 6details
#8ACCEPTED0.06 s3, 5, 6details
#9ACCEPTED0.05 s3, 5, 6details
#10ACCEPTED0.04 s3, 5, 6details
#11ACCEPTED0.04 s3, 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:3:25: warning: extra tokens at end of #include directive
    3 | #include "bits/stdc++.h";
      |                         ^

Code

#pragma GCC optimize("O3")

#include "bits/stdc++.h";

using namespace std;

int stickCount, maxCuts;

static int SubCut(multiset<int>& sticks, int cuts)
{
	int smallestDif = INT_MAX;

	if (cuts == 0)
	{
		if (*sticks.rbegin() - *sticks.begin() == 0)
		{
			cout << "";
		}
		return (*sticks.rbegin() - *sticks.begin());
	}

	int maxLength = *sticks.rbegin();
	sticks.extract(maxLength);

	for (int cutPos = 1; cutPos <= maxLength / 2; ++cutPos)
	{
		int stickA = cutPos;
		int stickB = maxLength - cutPos;
		sticks.insert(stickA);
		sticks.insert(stickB);

		int res = SubCut(sticks, cuts - 1);

		if (res < smallestDif)
		{
			smallestDif = res;
		}

		sticks.extract(stickA);
		sticks.extract(stickB);
	}

	sticks.insert(maxLength);
	return smallestDif;
}

static void Cut(multiset<int>& sticks, int cuts)
{
	cout << SubCut(sticks, cuts);
}

int main()
{
	cin >> stickCount >> maxCuts;
	

	multiset<int> stickLengths;

	for (int i = 0; i < stickCount; ++i)
	{
		int in;
		cin >> in;
		stickLengths.emplace(in);
	}
	//Cut(stickLengths, maxCuts);
	
	cout << "";

	for (int i = 0; i < maxCuts; ++i)
	{
		Cut(stickLengths, i + 1);

		if (i + 1 < maxCuts)
		{
			cout << " ";
		}
	}
}

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: ACCEPTED

input
5 10
4 8 6 2 7

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

user output
5 4 2 2 2 1 1 1 1 1

Test 3

Group: 1, 4, 5, 6

Verdict: ACCEPTED

input
5 10
5 5 8 6 7

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

user output
3 3 2 3 2 2 1 1 1 2

Test 4

Group: 1, 4, 5, 6

Verdict: ACCEPTED

input
5 10
8 7 9 6 10

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

user output
4 4 3 3 2 2 1 2 2 1

Test 5

Group: 2, 5, 6

Verdict: ACCEPTED

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
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

Test 6

Group: 2, 5, 6

Verdict: ACCEPTED

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
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...

Test 7

Group: 3, 5, 6

Verdict: ACCEPTED

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

correct output
994 994 

user output
994 994

Test 8

Group: 3, 5, 6

Verdict: ACCEPTED

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

correct output
498 496 

user output
498 496

Test 9

Group: 3, 5, 6

Verdict: ACCEPTED

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

correct output
500 500 

user output
500 500

Test 10

Group: 3, 5, 6

Verdict: ACCEPTED

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

correct output
500 500 

user output
500 500

Test 11

Group: 3, 5, 6

Verdict: ACCEPTED

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

correct output
1 168 

user output
1 168

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)