Submission #29821015

Source Code Expand

n = int(input())
a = [0] * n
b = [0] * n
c = [0] * n
for i in range(n):
    a[i], b[i], c[i] = map(int, input().split())
dpa = [0] * (n + 1)
dpb = [0] * (n + 1)
dpc = [0] * (n + 1)
for i in range(n):
    dpa[i + 1] = max(dpb[i], dpc[i]) + a[i]
    dpb[i + 1] = max(dpc[i], dpa[i]) + b[i]
    dpc[i + 1] = max(dpa[i], dpb[i]) + c[i]
print(max(dpa[n], dpb[n], dpc[n]))

Submission Info

Submission Time
Task C - Vacation
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 100
Code Size 379 Byte
Status AC
Exec Time 206 ms
Memory 79448 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 13
Set Name Test Cases
All 0_00, 0_01, 0_02, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09
Case Name Status Exec Time Memory
0_00 AC 65 ms 61448 KiB
0_01 AC 50 ms 61472 KiB
0_02 AC 51 ms 61920 KiB
1_00 AC 48 ms 61552 KiB
1_01 AC 186 ms 78900 KiB
1_02 AC 195 ms 79208 KiB
1_03 AC 201 ms 79448 KiB
1_04 AC 199 ms 79036 KiB
1_05 AC 201 ms 79408 KiB
1_06 AC 200 ms 78984 KiB
1_07 AC 206 ms 79324 KiB
1_08 AC 197 ms 79344 KiB
1_09 AC 195 ms 79220 KiB