Submission details
Task:Box stack I
Sender:aalto25c_002
Submission time:2025-09-17 16:45:27 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.01 sdetails
#3ACCEPTED0.01 sdetails
#4ACCEPTED0.01 sdetails
#5ACCEPTED0.01 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.01 sdetails
#9ACCEPTED0.01 sdetails
#10ACCEPTED0.01 sdetails
#11ACCEPTED0.01 sdetails
#12ACCEPTED0.01 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.01 sdetails
#16ACCEPTED0.01 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.02 sdetails
#19ACCEPTED0.01 sdetails
#20ACCEPTED0.01 sdetails
#21ACCEPTED0.01 sdetails
#22ACCEPTED0.01 sdetails
#23ACCEPTED0.01 sdetails
#24ACCEPTED0.01 sdetails
#25ACCEPTED0.01 sdetails
#26ACCEPTED0.01 sdetails
#27ACCEPTED0.01 sdetails
#28ACCEPTED0.01 sdetails
#29ACCEPTED0.01 sdetails
#30ACCEPTED0.01 sdetails
#310.01 sdetails
#320.01 sdetails
#330.01 sdetails
#340.01 sdetails
#350.01 sdetails
#360.01 sdetails
#370.02 sdetails
#380.01 sdetails
#390.01 sdetails
#400.01 sdetails
#410.02 sdetails
#420.02 sdetails
#430.02 sdetails
#440.02 sdetails
#450.02 sdetails
#460.02 sdetails
#470.02 sdetails
#480.02 sdetails
#490.02 sdetails
#500.02 sdetails
#510.02 sdetails
#520.02 sdetails
#530.02 sdetails
#540.02 sdetails
#550.02 sdetails
#560.02 sdetails
#570.02 sdetails
#580.02 sdetails
#590.02 sdetails
#600.02 sdetails

Code

#include <bits/stdc++.h>

using namespace std;

struct box {
  int w, c, h;
};

const int N = 2e3 + 5;

int n;
box a[N];
int f[N][N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].w >> a[i].c >> a[i].h;
  }
  sort(a + 1, a + n + 1, [](const box &u, const box &v) -> bool {
    return u.c + u.w < v.c + v.w;
  });
  memset(f, 0, sizeof(f));
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < N; j++) {
      f[i][j] = f[i - 1][j];
    }
    for (int j = a[i].w; j < N; j++) {
      if (a[i].c >= j - a[i].w) {
        f[i][j] = max(f[i][j], f[i - 1][j - a[i].w] + a[i].h);
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < N; i++) {
    ans = max(ans, f[n][i]);
  }
  cout << ans << '\n';
  return 0;
}

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:

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

correct output
16023

user output
14340

Test 32

Verdict:

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

correct output
16049

user output
14608

Test 33

Verdict:

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

correct output
14165

user output
12665

Test 34

Verdict:

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

correct output
12391

user output
10795

Test 35

Verdict:

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

correct output
19385

user output
17603

Test 36

Verdict:

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

correct output
15364

user output
13804

Test 37

Verdict:

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

correct output
15648

user output
14003

Test 38

Verdict:

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

correct output
12527

user output
10910

Test 39

Verdict:

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

correct output
12817

user output
11281

Test 40

Verdict:

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

correct output
15927

user output
14305

Test 41

Verdict:

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

correct output
20991

user output
19122

Test 42

Verdict:

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

correct output
24785

user output
23582

Test 43

Verdict:

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

correct output
20005

user output
18830

Test 44

Verdict:

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

correct output
21655

user output
20233

Test 45

Verdict:

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

correct output
24716

user output
23055

Test 46

Verdict:

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

correct output
20753

user output
19338

Test 47

Verdict:

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

correct output
25462

user output
23726

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:

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

correct output
19995

user output
18349

Test 50

Verdict:

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

correct output
26434

user output
24842

Test 51

Verdict:

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

correct output
51198

user output
49407

Test 52

Verdict:

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

correct output
49723

user output
48166

Test 53

Verdict:

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

correct output
47760

user output
45936

Test 54

Verdict:

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

correct output
46095

user output
44099

Test 55

Verdict:

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

correct output
55178

user output
53396

Test 56

Verdict:

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

correct output
76003

user output
74180

Test 57

Verdict:

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

correct output
69375

user output
67705

Test 58

Verdict:

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

correct output
68402

user output
66532

Test 59

Verdict:

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

correct output
76262

user output
74611

Test 60

Verdict:

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

correct output
81251

user output
79431