Submission details
Task:Box stack I
Sender:aalto26cw_004
Submission time:2026-09-16 19:18:52 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.05 sdetails
#2ACCEPTED0.05 sdetails
#3ACCEPTED0.05 sdetails
#4ACCEPTED0.05 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.05 sdetails
#7ACCEPTED0.05 sdetails
#8ACCEPTED0.05 sdetails
#9ACCEPTED0.05 sdetails
#10ACCEPTED0.05 sdetails
#11ACCEPTED0.05 sdetails
#12ACCEPTED0.05 sdetails
#13ACCEPTED0.05 sdetails
#14ACCEPTED0.05 sdetails
#15ACCEPTED0.05 sdetails
#16ACCEPTED0.05 sdetails
#17ACCEPTED0.05 sdetails
#18ACCEPTED0.05 sdetails
#19ACCEPTED0.05 sdetails
#20ACCEPTED0.05 sdetails
#21ACCEPTED0.05 sdetails
#22ACCEPTED0.05 sdetails
#23ACCEPTED0.05 sdetails
#24ACCEPTED0.05 sdetails
#25ACCEPTED0.05 sdetails
#26ACCEPTED0.05 sdetails
#27ACCEPTED0.05 sdetails
#28ACCEPTED0.05 sdetails
#29ACCEPTED0.05 sdetails
#30ACCEPTED0.05 sdetails
#31ACCEPTED0.32 sdetails
#32ACCEPTED0.99 sdetails
#33ACCEPTED0.32 sdetails
#34ACCEPTED0.87 sdetails
#35ACCEPTED0.35 sdetails
#36ACCEPTED0.33 sdetails
#37ACCEPTED0.70 sdetails
#38ACCEPTED0.25 sdetails
#39ACCEPTED0.41 sdetails
#40ACCEPTED0.77 sdetails
#41ACCEPTED0.67 sdetails
#42ACCEPTED0.64 sdetails
#43ACCEPTED0.67 sdetails
#44ACCEPTED0.65 sdetails
#45ACCEPTED0.66 sdetails
#46--details
#47--details
#48ACCEPTED0.65 sdetails
#49ACCEPTED0.69 sdetails
#50ACCEPTED0.66 sdetails
#51--details
#52--details
#53--details
#54--details
#55--details
#56--details
#57--details
#58--details
#59--details
#60--details

Code

import sys
from functools import lru_cache


def main():
    sys.setrecursionlimit(10000)
    n = int(input())
    boxes = []
    for _ in range(n):
        w, c, h = map(int, input().split())
        boxes.append((w, c, h))

    boxes.sort(key=lambda b: b[0] + b[1])

    @lru_cache(maxsize=None)
    def f(i, j):
        # boxes[i:] are still available, j kg already rests above this position
        if i == n:
            return 0
        w, c, h = boxes[i]
        best = f(i + 1, j)  # don't use this box
        if j <= c:  # it can carry what's above
            best = max(best, h + f(i + 1, j + w))
        return best

    print(f(0, 0))


main()

Test details

Test 1

Verdict: ACCEPTED

input
1
6 7 10

correct output
10

user output
10

Test 2

Verdict: ACCEPTED

input
2
5 2 4
1 2 10

correct output
14

user output
14

Test 3

Verdict: ACCEPTED

input
2
8 2 3
3 8 5

correct output
8

user output
8

Test 4

Verdict: ACCEPTED

input
3
7 3 6
10 8 9
3 6 2

correct output
15

user output
15

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

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

correct output
10

user output
10

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

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

correct output
18

user output
18

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

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

correct output
17

user output
17

Test 14

Verdict: ACCEPTED

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

correct output
17

user output
17

Test 15

Verdict: ACCEPTED

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

correct output
22

user output
22

Test 16

Verdict: ACCEPTED

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

correct output
19

user output
19

Test 17

Verdict: ACCEPTED

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

correct output
12

user output
12

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

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

correct output
16

user output
16

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

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

correct output
22

user output
22

Test 22

Verdict: ACCEPTED

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

correct output
29

user output
29

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

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

correct output
19

user output
19

Test 25

Verdict: ACCEPTED

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

correct output
31

user output
31

Test 26

Verdict: ACCEPTED

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

correct output
28

user output
28

Test 27

Verdict: ACCEPTED

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

correct output
21

user output
21

Test 28

Verdict: ACCEPTED

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

correct output
28

user output
28

Test 29

Verdict: ACCEPTED

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

correct output
27

user output
27

Test 30

Verdict: ACCEPTED

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

correct output
29

user output
29

Test 31

Verdict: ACCEPTED

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

correct output
16023

user output
16023

Test 32

Verdict: ACCEPTED

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

correct output
16049

user output
16049

Test 33

Verdict: ACCEPTED

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

correct output
14165

user output
14165

Test 34

Verdict: ACCEPTED

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

correct output
12391

user output
12391

Test 35

Verdict: ACCEPTED

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

correct output
19385

user output
19385

Test 36

Verdict: ACCEPTED

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

correct output
15364

user output
15364

Test 37

Verdict: ACCEPTED

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

correct output
15648

user output
15648

Test 38

Verdict: ACCEPTED

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

correct output
12527

user output
12527

Test 39

Verdict: ACCEPTED

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

correct output
12817

user output
12817

Test 40

Verdict: ACCEPTED

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

correct output
15927

user output
15927

Test 41

Verdict: ACCEPTED

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

correct output
20991

user output
20991

Test 42

Verdict: ACCEPTED

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

correct output
24785

user output
24785

Test 43

Verdict: ACCEPTED

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

correct output
20005

user output
20005

Test 44

Verdict: ACCEPTED

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

correct output
21655

user output
21655

Test 45

Verdict: ACCEPTED

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

correct output
24716

user output
24716

Test 46

Verdict:

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

correct output
20753

user output
(empty)

Test 47

Verdict:

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

correct output
25462

user output
(empty)

Test 48

Verdict: ACCEPTED

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

correct output
19588

user output
19588

Test 49

Verdict: ACCEPTED

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

correct output
19995

user output
19995

Test 50

Verdict: ACCEPTED

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

correct output
26434

user output
26434

Test 51

Verdict:

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

correct output
51198

user output
(empty)

Test 52

Verdict:

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

correct output
49723

user output
(empty)

Test 53

Verdict:

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

correct output
47760

user output
(empty)

Test 54

Verdict:

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

correct output
46095

user output
(empty)

Test 55

Verdict:

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

correct output
55178

user output
(empty)

Test 56

Verdict:

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

correct output
76003

user output
(empty)

Test 57

Verdict:

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

correct output
69375

user output
(empty)

Test 58

Verdict:

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

correct output
68402

user output
(empty)

Test 59

Verdict:

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

correct output
76262

user output
(empty)

Test 60

Verdict:

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

correct output
81251

user output
(empty)