CSES - Aalto Competitive Programming 2024 - wk3 - Wed - Results
Submission details
Task:Box stack I
Sender:aalto2024c_003
Submission time:2024-09-18 17:47:48 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#2ACCEPTED0.00 sdetails
#30.00 sdetails
#40.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.00 sdetails
#90.00 sdetails
#10ACCEPTED0.00 sdetails
#110.00 sdetails
#12ACCEPTED0.00 sdetails
#130.00 sdetails
#140.00 sdetails
#150.00 sdetails
#160.00 sdetails
#170.00 sdetails
#18ACCEPTED0.00 sdetails
#190.00 sdetails
#20ACCEPTED0.00 sdetails
#210.00 sdetails
#220.00 sdetails
#23ACCEPTED0.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.01 sdetails
#270.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 sdetails
#370.00 sdetails
#380.00 sdetails
#390.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#430.00 sdetails
#440.00 sdetails
#450.00 sdetails
#460.00 sdetails
#470.00 sdetails
#480.00 sdetails
#490.00 sdetails
#500.00 sdetails
#510.01 sdetails
#520.01 sdetails
#530.01 sdetails
#540.01 sdetails
#550.01 sdetails
#560.01 sdetails
#570.01 sdetails
#580.01 sdetails
#590.01 sdetails
#600.01 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:36:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i = 0; i < boxes.size(); i++)
      |                     ~~^~~~~~~~~~~~~~
input/code.cpp:52:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for (int i = 0; i < maxHeights.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~~

Code

// Online C++ compiler to run C++ program online
#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>

using namespace std;

bool comp(tuple<int, int, int>& t1, tuple<int, int, int>& t2) { 
    if (get<1>(t1) == get<1>(t2))
        return get<0>(t1) < get<0>(t2);
    return get<1>(t1) < get<1>(t2); 
}

int main() {
    int n;
    cin >> n;
    
    // weight, hold, height
    vector<tuple<int, int, int>> boxes(n);
    
    for (int i = 0; i < n; i++)
    {
        int w, k, h;
        cin >> w >> k >> h;
        boxes[i] = make_tuple(w, k, h);
    }
    
    sort(boxes.begin(), boxes.end(), comp);
    
    
    // Array of maxHeights based on kg
    vector<int> maxHeights = vector<int>(4001, 0);
    
    // maxHeights[i] means the biggest stack that has that weight
    for (int i = 0; i < boxes.size(); i++)
    {
        /*cout << i << ": ";
        for (int i = 0; i < maxHeights.size(); i++)
            cout << maxHeights[i] << " ";
        cout << endl;
        //*/
        
        for (int w = get<1>(boxes[i]); w >= 0; w--)
        {
            maxHeights[w + get<0>(boxes[i])] = max(w + get<0>(boxes[i]),
                maxHeights[w] + get<2>(boxes[i]));
        }
    }
    
    int maxVal = 0;
    for (int i = 0; i < maxHeights.size(); i++)
        maxVal = max(maxVal, maxHeights[i]);
    cout << maxVal;
    
    return 0;
}

Test details

Test 1

Verdict:

input
1
6 7 10

correct output
10

user output
13

Test 2

Verdict: ACCEPTED

input
2
5 2 4
1 2 10

correct output
14

user output
14

Test 3

Verdict:

input
2
8 2 3
3 8 5

correct output
8

user output
13

Test 4

Verdict:

input
3
7 3 6
10 8 9
3 6 2

correct output
15

user output
18

Test 5

Verdict: ACCEPTED

input
3
9 6 9
4 4 6
7 2 7

correct output
15

user output
15

Test 6

Verdict: ACCEPTED

input
3
10 7 6
3 2 8
2 1 9

correct output
23

user output
23

Test 7

Verdict: ACCEPTED

input
4
8 4 2
3 4 10
5 10 5
2 6 2

correct output
17

user output
17

Test 8

Verdict: ACCEPTED

input
4
3 6 5
1 1 10
10 9 5
4 8 6

correct output
26

user output
26

Test 9

Verdict:

input
4
7 3 6
10 5 9
6 10 1
6 7 1

correct output
10

user output
16

Test 10

Verdict: ACCEPTED

input
4
8 1 6
2 7 7
9 6 2
5 2 10

correct output
17

user output
17

Test 11

Verdict:

input
5
6 6 8
9 7 9
6 9 5
7 7 4
...

correct output
18

user output
16

Test 12

Verdict: ACCEPTED

input
5
5 10 8
10 1 2
4 10 2
3 1 4
...

correct output
18

user output
18

Test 13

Verdict:

input
5
5 2 1
10 6 10
5 5 5
4 4 2
...

correct output
17

user output
16

Test 14

Verdict:

input
5
6 1 8
9 3 2
6 6 9
5 9 1
...

correct output
17

user output
14

Test 15

Verdict:

input
5
10 10 6
2 10 9
8 7 7
6 3 2
...

correct output
22

user output
23

Test 16

Verdict:

input
5
3 1 9
9 3 4
10 10 5
1 7 4
...

correct output
19

user output
20

Test 17

Verdict:

input
5
9 10 4
3 9 1
1 4 2
10 6 1
...

correct output
12

user output
19

Test 18

Verdict: ACCEPTED

input
5
1 3 8
4 5 10
8 5 10
4 6 3
...

correct output
28

user output
28

Test 19

Verdict:

input
5
9 1 10
3 9 4
6 9 3
5 1 7
...

correct output
16

user output
15

Test 20

Verdict: ACCEPTED

input
5
1 4 6
5 5 1
2 4 2
1 3 9
...

correct output
18

user output
18

Test 21

Verdict:

input
10
6 6 8
9 7 9
6 9 5
7 7 4
...

correct output
22

user output
16

Test 22

Verdict:

input
10
5 10 8
10 1 2
4 10 2
3 1 4
...

correct output
29

user output
19

Test 23

Verdict: ACCEPTED

input
10
5 2 1
10 6 10
5 5 5
4 4 2
...

correct output
25

user output
25

Test 24

Verdict:

input
10
6 1 8
9 3 2
6 6 9
5 9 1
...

correct output
19

user output
14

Test 25

Verdict:

input
10
10 10 6
2 10 9
8 7 7
6 3 2
...

correct output
31

user output
29

Test 26

Verdict:

input
10
3 1 9
9 3 4
10 10 5
1 7 4
...

correct output
28

user output
20

Test 27

Verdict:

input
10
9 10 4
3 9 1
1 4 2
10 6 1
...

correct output
21

user output
19

Test 28

Verdict:

input
10
1 3 8
4 5 10
8 5 10
4 6 3
...

correct output
28

user output
19

Test 29

Verdict:

input
10
9 1 10
3 9 4
6 9 3
5 1 7
...

correct output
27

user output
18

Test 30

Verdict:

input
10
1 4 6
5 5 1
2 4 2
1 3 9
...

correct output
29

user output
18

Test 31

Verdict:

input
100
1098 1186 1431
1689 1206 1716
1090 1695 848
1248 1292 769
...

correct output
16023

user output
10442

Test 32

Verdict:

input
100
835 1995 1441
1866 1 257
605 1999 294
473 185 794
...

correct output
16049

user output
7105

Test 33

Verdict:

input
100
872 371 52
1864 1100 1896
871 970 841
642 661 309
...

correct output
14165

user output
5825

Test 34

Verdict:

input
100
1102 142 1417
1680 582 243
1022 1139 1786
875 1793 38
...

correct output
12391

user output
6117

Test 35

Verdict:

input
100
1935 1802 1095
346 1946 1712
1430 1219 1396
1196 433 283
...

correct output
19385

user output
13957

Test 36

Verdict:

input
100
444 111 1742
1663 414 728
1838 1959 977
180 1224 794
...

correct output
15364

user output
6564

Test 37

Verdict:

input
100
1786 1895 664
419 1643 129
84 741 216
1971 1191 199
...

correct output
15648

user output
8004

Test 38

Verdict:

input
100
153 455 1560
638 877 1957
1447 912 1956
617 1077 528
...

correct output
12527

user output
6944

Test 39

Verdict:

input
100
1747 23 1938
479 1739 756
1062 1633 466
845 23 1225
...

correct output
12817

user output
5959

Test 40

Verdict:

input
100
21 729 1004
999 992 16
268 633 285
27 438 1755
...

correct output
15927

user output
10835

Test 41

Verdict:

input
200
1098 1186 1431
1689 1206 1716
1090 1695 848
1248 1292 769
...

correct output
20991

user output
12693

Test 42

Verdict:

input
200
835 1995 1441
1866 1 257
605 1999 294
473 185 794
...

correct output
24785

user output
8128

Test 43

Verdict:

input
200
872 371 52
1864 1100 1896
871 970 841
642 661 309
...

correct output
20005

user output
6548

Test 44

Verdict:

input
200
1102 142 1417
1680 582 243
1022 1139 1786
875 1793 38
...

correct output
21655

user output
8836

Test 45

Verdict:

input
200
1935 1802 1095
346 1946 1712
1430 1219 1396
1196 433 283
...

correct output
24716

user output
11267

Test 46

Verdict:

input
200
444 111 1742
1663 414 728
1838 1959 977
180 1224 794
...

correct output
20753

user output
11623

Test 47

Verdict:

input
200
1786 1895 664
419 1643 129
84 741 216
1971 1191 199
...

correct output
25462

user output
8865

Test 48

Verdict:

input
200
153 455 1560
638 877 1957
1447 912 1956
617 1077 528
...

correct output
19588

user output
8522

Test 49

Verdict:

input
200
1747 23 1938
479 1739 756
1062 1633 466
845 23 1225
...

correct output
19995

user output
8403

Test 50

Verdict:

input
200
21 729 1004
999 992 16
268 633 285
27 438 1755
...

correct output
26434

user output
9523

Test 51

Verdict:

input
1000
1098 1186 1431
1689 1206 1716
1090 1695 848
1248 1292 769
...

correct output
51198

user output
15615

Test 52

Verdict:

input
1000
835 1995 1441
1866 1 257
605 1999 294
473 185 794
...

correct output
49723

user output
14075

Test 53

Verdict:

input
1000
872 371 52
1864 1100 1896
871 970 841
642 661 309
...

correct output
47760

user output
12766

Test 54

Verdict:

input
1000
1102 142 1417
1680 582 243
1022 1139 1786
875 1793 38
...

correct output
46095

user output
13379

Test 55

Verdict:

input
1000
1935 1802 1095
346 1946 1712
1430 1219 1396
1196 433 283
...

correct output
55178

user output
14886

Test 56

Verdict:

input
2000
444 111 1742
1663 414 728
1838 1959 977
180 1224 794
...

correct output
76003

user output
13884

Test 57

Verdict:

input
2000
1786 1895 664
419 1643 129
84 741 216
1971 1191 199
...

correct output
69375

user output
14091

Test 58

Verdict:

input
2000
153 455 1560
638 877 1957
1447 912 1956
617 1077 528
...

correct output
68402

user output
19492

Test 59

Verdict:

input
2000
1747 23 1938
479 1739 756
1062 1633 466
845 23 1225
...

correct output
76262

user output
18318

Test 60

Verdict:

input
2000
21 729 1004
999 992 16
268 633 285
27 438 1755
...

correct output
81251

user output
18077