CSES - Aalto Competitive Programming 2024 - wk3 - Wed - Results
Submission details
Task:Box stack I
Sender:aalto2024c_005
Submission time:2024-09-18 17:08:47 +0300
Language:CPython3
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#20.02 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#6ACCEPTED0.02 sdetails
#7ACCEPTED0.02 sdetails
#8ACCEPTED0.02 sdetails
#9ACCEPTED0.02 sdetails
#10ACCEPTED0.02 sdetails
#11ACCEPTED0.02 sdetails
#12ACCEPTED0.02 sdetails
#130.02 sdetails
#14ACCEPTED0.02 sdetails
#150.03 sdetails
#160.02 sdetails
#17ACCEPTED0.02 sdetails
#18ACCEPTED0.02 sdetails
#190.02 sdetails
#20ACCEPTED0.02 sdetails
#21ACCEPTED0.02 sdetails
#22ACCEPTED0.02 sdetails
#23ACCEPTED0.02 sdetails
#240.02 sdetails
#250.02 sdetails
#26ACCEPTED0.02 sdetails
#270.02 sdetails
#28ACCEPTED0.02 sdetails
#29ACCEPTED0.02 sdetails
#30ACCEPTED0.02 sdetails
#31ACCEPTED0.13 sdetails
#32ACCEPTED0.15 sdetails
#330.14 sdetails
#340.12 sdetails
#350.13 sdetails
#360.13 sdetails
#37ACCEPTED0.12 sdetails
#380.10 sdetails
#39ACCEPTED0.11 sdetails
#40ACCEPTED0.13 sdetails
#41ACCEPTED0.33 sdetails
#420.33 sdetails
#430.32 sdetails
#44ACCEPTED0.32 sdetails
#450.31 sdetails
#460.28 sdetails
#470.28 sdetails
#480.29 sdetails
#49ACCEPTED0.29 sdetails
#500.28 sdetails
#510.33 sdetails
#520.32 sdetails
#530.32 sdetails
#540.32 sdetails
#550.33 sdetails
#560.64 sdetails
#570.64 sdetails
#580.64 sdetails
#590.64 sdetails
#600.63 sdetails

Code

def knapsack(W, m):
    global t, x
    if W == 0 or m == 0:
        return 0
    if t[m][W] != -1:
        return t[m][W]

    if x[m - 1][0] <= W:
        t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
        return t[m][W]
    t[m][W] = knapsack(W, m - 1)
    return t[m][W]


n = int(input())
x = [[] for i in range(n)]
for i in range(n):
    w, c, h = map(int, input().split())
    x[i] = [w, c, h]
x = sorted(x, key=lambda a: a[1])

t = [[-1 for i in range(5000 + 1)] for j in range(n + 1)]
print(knapsack(5000, n))


Test details

Test 1

Verdict: ACCEPTED

input
1
6 7 10

correct output
10

user output
10

Test 2

Verdict:

input
2
5 2 4
1 2 10

correct output
14

user output
10

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:

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

correct output
17

user output
15

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:

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

correct output
22

user output
16

Test 16

Verdict:

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

correct output
19

user output
18

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:

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

correct output
16

user output
14

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:

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

correct output
19

user output
17

Test 25

Verdict:

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

correct output
31

user output
25

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:

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

correct output
21

user output
20

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:

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

correct output
14165

user output
13922

Test 34

Verdict:

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

correct output
12391

user output
12037

Test 35

Verdict:

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

correct output
19385

user output
18564

Test 36

Verdict:

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

correct output
15364

user output
14983

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:

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

correct output
12527

user output
11985

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:

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

correct output
24785

user output
24666

Test 43

Verdict:

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

correct output
20005

user output
19923

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:

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

correct output
24716

user output
24472

Test 46

Verdict:

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

correct output
20753

user output
20686

Test 47

Verdict:

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

correct output
25462

user output
24897

Test 48

Verdict:

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

correct output
19588

user output
18406

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:

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

correct output
26434

user output
26239

Test 51

Verdict:

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

correct output
51198

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.p...

Test 52

Verdict:

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

correct output
49723

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.p...

Test 53

Verdict:

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

correct output
47760

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0...

Test 54

Verdict:

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

correct output
46095

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  [Previous line repeated 12 more times]
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knap...

Test 55

Verdict:

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

correct output
55178

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.p...

Test 56

Verdict:

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

correct output
76003

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  [Previous line repeated 1 more time]
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsa...

Test 57

Verdict:

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

correct output
69375

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  [Previous line repeated 1 more time]
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsa...

Test 58

Verdict:

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

correct output
68402

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  [Previous line repeated 1 more time]
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knaps...

Test 59

Verdict:

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

correct output
76262

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  [Previous line repeated 2 more times]
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 11, in knapsack
    t...

Test 60

Verdict:

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

correct output
81251

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 23, in <module>
    print(knapsack(5000, n))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11, in knapsack
    t[m][W] = knapsack(W, m - 1)
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 9, in knapsack
    t[m][W] = max(x[m - 1][2] + knapsack(min(W - x[m - 1][0], x[m - 1][1]), m - 1), knapsack(W, m - 1))
  File "/box/input/code.py", line 11,...