Submission details
Task:LumberUolevi
Sender:aalto26aw_008
Submission time:2026-09-02 16:44:44 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#9ACCEPTED0.00 sdetails
#100.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#150.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#180.00 sdetails
#19ACCEPTED0.00 sdetails
#200.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#250.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#300.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.00 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.01 sdetails
#48ACCEPTED0.00 sdetails
#49ACCEPTED0.01 sdetails
#50ACCEPTED0.00 sdetails
#51ACCEPTED0.01 sdetails
#52ACCEPTED0.01 sdetails
#53ACCEPTED0.01 sdetails
#54ACCEPTED0.01 sdetails
#55ACCEPTED0.01 sdetails
#56ACCEPTED0.01 sdetails
#57ACCEPTED0.01 sdetails
#58ACCEPTED0.01 sdetails
#59ACCEPTED0.01 sdetails
#60ACCEPTED0.00 sdetails
#61ACCEPTED0.01 sdetails
#62ACCEPTED0.01 sdetails
#63ACCEPTED0.01 sdetails

Code

/*
Uolevi owns a forest that has n trees numbered 1,2,...,n. 
The i-th tree weighs i kilos. He also has an unlimited number of lumber trucks, each of which can conveniently fit n kilos of wood.
Uolevi is planning to thin the forest by cutting k trees. 
Help Uolevi select those trees in such a way that they can be transported with some number of trucks, minimizing the total empty space in them. 
The trees can be cut into smaller pieces to fill the trucks more tightly. If there are multiple answers, print any.
Input
The only line of input contains the size of the forest n and the number of trees to cut k.
Output
Output t1,t2,...,tk the trees that Uolevi should cut, on one line.
Constraints
1 <= k <= n <= 10^5

Example 1
Input:
6 1

Output:
6
Example 2
Input:
10 6

Output:
1 2 3 5 9 10
Example 3
Input:
4 4

Output:
1 2 3 4
*/

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;

int main()
{
  int n, k;
  cin>>n>>k;
  vector<int> first;
  vector<int> last;
  for(int i = 1; i <= k/2; i++)
    {
        first.push_back(i);
        last.push_back(n-i);
    }
  for(int i = 0; i < k/2; i++) cout<<first.at(i)<<" ";
  for(int i = k/2 - 1; i > 0; i--) cout<<last.at(i)<<" ";
  cout << last.at(0);
  if(k%2!=0) cout<<" "<<n;  

  return 0;
}

Test details

Test 1

Verdict:

input
1 1

correct output

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 2

Verdict:

input
2 1

correct output

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 3

Verdict:

input
2 1

correct output

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 4

Verdict: ACCEPTED

input
3 2

correct output
1 2 

user output
1 2

Test 5

Verdict: ACCEPTED

input
3 3

correct output
1 2 3 

user output
1 2 3

Test 6

Verdict:

input
4 1

correct output

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 7

Verdict:

input
4 4

correct output
1 2 3 4 

user output
1 2 2 3

Test 8

Verdict:

input
5 1

correct output

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 9

Verdict: ACCEPTED

input
5 5

correct output
1 2 3 4 5 

user output
1 2 3 4 5

Test 10

Verdict:

input
6 1

correct output

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 11

Verdict: ACCEPTED

input
10 6

correct output
1 2 3 5 9 10 

user output
1 2 3 7 8 9

Test 12

Verdict: ACCEPTED

input
10 5

correct output
1 2 3 4 10 

user output
1 2 8 9 10

Test 13

Verdict: ACCEPTED

input
10 5

correct output
1 2 3 4 10 

user output
1 2 8 9 10

Test 14

Verdict: ACCEPTED

input
10 6

correct output
1 2 3 5 9 10 

user output
1 2 3 7 8 9

Test 15

Verdict:

input
10 10

correct output
1 2 3 4 5 6 7 8 9 10 

user output
1 2 3 4 5 5 6 7 8 9

Test 16

Verdict: ACCEPTED

input
11 3

correct output
1 2 8 

user output
1 10 11

Test 17

Verdict: ACCEPTED

input
11 10

correct output
1 2 3 4 5 6 7 8 9 10 

user output
1 2 3 4 5 6 7 8 9 10

Test 18

Verdict:

input
11 1

correct output
11 

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 19

Verdict: ACCEPTED

input
12 11

correct output
1 2 3 4 5 7 8 9 10 11 12 

user output
1 2 3 4 5 7 8 9 10 11 12

Test 20

Verdict:

input
12 1

correct output
12 

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 21

Verdict: ACCEPTED

input
20 11

correct output
1 2 3 4 5 6 7 8 9 15 20 

user output
1 2 3 4 5 15 16 17 18 19 20

Test 22

Verdict: ACCEPTED

input
20 9

correct output
1 2 3 4 5 6 7 12 20 

user output
1 2 3 4 16 17 18 19 20

Test 23

Verdict: ACCEPTED

input
21 10

correct output
1 2 3 4 5 6 7 8 9 18 

user output
1 2 3 4 5 16 17 18 19 20

Test 24

Verdict: ACCEPTED

input
22 13

correct output
1 2 3 4 5 6 7 8 9 10 12 21 22 

user output
1 2 3 4 5 6 16 17 18 19 20 21 ...

Test 25

Verdict:

input
20 20

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 10 11 12 ...

Test 26

Verdict: ACCEPTED

input
20 5

correct output
1 2 3 4 10 

user output
1 2 18 19 20

Test 27

Verdict: ACCEPTED

input
23 21

correct output
1 2 3 4 5 6 7 8 9 10 13 14 15 ...

user output
1 2 3 4 5 6 7 8 9 10 13 14 15 ...

Test 28

Verdict: ACCEPTED

input
24 2

correct output
1 23 

user output
1 23

Test 29

Verdict: ACCEPTED

input
20 18

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 11 12 13 14 ...

Test 30

Verdict:

input
25 1

correct output
25 

user output
(empty)

Error:
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)

Test 31

Verdict: ACCEPTED

input
123 68

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 32

Verdict: ACCEPTED

input
201 84

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 33

Verdict: ACCEPTED

input
200 88

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 34

Verdict: ACCEPTED

input
202 112

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 35

Verdict: ACCEPTED

input
200 194

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 36

Verdict: ACCEPTED

input
204 46

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 37

Verdict: ACCEPTED

input
205 184

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 38

Verdict: ACCEPTED

input
200 16

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 192 193 194 19...

Test 39

Verdict: ACCEPTED

input
207 181

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 40

Verdict: ACCEPTED

input
201 3

correct output
1 2 198 

user output
1 200 201

Test 41

Verdict: ACCEPTED

input
1123 617

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 42

Verdict: ACCEPTED

input
2201 918

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 43

Verdict: ACCEPTED

input
3200 1396

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 44

Verdict: ACCEPTED

input
2202 1213

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 45

Verdict: ACCEPTED

input
1200 1161

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 46

Verdict: ACCEPTED

input
5204 1156

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 47

Verdict: ACCEPTED

input
6205 5541

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 48

Verdict: ACCEPTED

input
3200 245

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 49

Verdict: ACCEPTED

input
7207 6295

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 50

Verdict: ACCEPTED

input
9201 96

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 51

Verdict: ACCEPTED

input
51123 28058

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 52

Verdict: ACCEPTED

input
32201 13429

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 53

Verdict: ACCEPTED

input
23200 10116

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 54

Verdict: ACCEPTED

input
12202 6721

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 55

Verdict: ACCEPTED

input
21200 20502

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 56

Verdict: ACCEPTED

input
35204 7816

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 57

Verdict: ACCEPTED

input
46205 41255

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 58

Verdict: ACCEPTED

input
63200 4823

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 59

Verdict: ACCEPTED

input
87207 76170

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 60

Verdict: ACCEPTED

input
99201 1030

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 61

Verdict: ACCEPTED

input
100000 54883

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 62

Verdict: ACCEPTED

input
100000 41703

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 63

Verdict: ACCEPTED

input
100000 43601

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...