Submission #3981234

Source Code Expand

N = int(input())
P = [list(map(int, input().split())) for i in range(N)]
P.sort(key=lambda x: x[0]+x[1])

L = 10**5
dp = [0]*L
for w, s, v in P:
    for i in range(s, -1, -1):
        dp[i+w] = max(dp[i+w], dp[i] + v)
print(max(dp))

Submission Info

Submission Time
Task X - Tower
User yaketake08
Language PyPy3 (2.4.0)
Score 100
Code Size 241 Byte
Status AC
Exec Time 355 ms
Memory 42988 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 25
Set Name Test Cases
All 0_00, 0_01, 0_02, 0_03, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 1_15, 1_16, 1_17, 1_18, 1_19, 1_20
Case Name Status Exec Time Memory
0_00 AC 177 ms 39024 KiB
0_01 AC 179 ms 39024 KiB
0_02 AC 185 ms 39408 KiB
0_03 AC 184 ms 39024 KiB
1_00 AC 182 ms 39024 KiB
1_01 AC 355 ms 42348 KiB
1_02 AC 234 ms 41072 KiB
1_03 AC 223 ms 40944 KiB
1_04 AC 223 ms 40944 KiB
1_05 AC 223 ms 40944 KiB
1_06 AC 226 ms 41072 KiB
1_07 AC 226 ms 41200 KiB
1_08 AC 228 ms 41328 KiB
1_09 AC 233 ms 41328 KiB
1_10 AC 258 ms 42860 KiB
1_11 AC 311 ms 42860 KiB
1_12 AC 261 ms 42860 KiB
1_13 AC 271 ms 42860 KiB
1_14 AC 290 ms 42860 KiB
1_15 AC 300 ms 42860 KiB
1_16 AC 300 ms 42860 KiB
1_17 AC 276 ms 42860 KiB
1_18 AC 327 ms 42988 KiB
1_19 AC 311 ms 42860 KiB
1_20 AC 271 ms 42860 KiB