提出 #72020878
ソースコード 拡げる
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
A,B,C = [0]+A,[0]+B,[0]+C
SumA = [0]*(N+1)
SumB = [0]*(N+1)
SumC = [0]*(N+1)
for i in range(1,N+1):
SumA[i] = SumA[i-1]+A[i]
SumB[i] = SumB[i-1]+B[i]
SumC[i] = SumC[i-1]+C[i]
#y固定でSumA+SumBの最大
SumAB = [0]*(N+1)
for y in range(2,N):
SumAB[y] = max(SumAB[y-1]+B[y], SumA[y-1]+B[y])
#SumAB+SumCの最大値
ans = 0
for y in range(2,N):
if ans < SumAB[y] + SumC[N] - SumC[y]:
ans = SumAB[y] + SumC[N] - SumC[y]
print(ans)
提出情報
| 提出日時 | |
|---|---|
| 問題 | D - Tail of Snake |
| ユーザ | exophia |
| 言語 | Python (PyPy 3.11-v7.3.20) |
| 得点 | 400 |
| コード長 | 596 Byte |
| 結果 | AC |
| 実行時間 | 168 ms |
| メモリ | 229108 KiB |
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 400 / 400 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | sample00.txt, sample01.txt, sample02.txt |
| All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| sample00.txt | AC | 46 ms | 79896 KiB |
| sample01.txt | AC | 45 ms | 79756 KiB |
| sample02.txt | AC | 45 ms | 79724 KiB |
| testcase00.txt | AC | 45 ms | 79696 KiB |
| testcase01.txt | AC | 46 ms | 79764 KiB |
| testcase02.txt | AC | 46 ms | 79576 KiB |
| testcase03.txt | AC | 150 ms | 224088 KiB |
| testcase04.txt | AC | 152 ms | 226328 KiB |
| testcase05.txt | AC | 151 ms | 223648 KiB |
| testcase06.txt | AC | 151 ms | 224748 KiB |
| testcase07.txt | AC | 152 ms | 223196 KiB |
| testcase08.txt | AC | 151 ms | 223412 KiB |
| testcase09.txt | AC | 156 ms | 228192 KiB |
| testcase10.txt | AC | 155 ms | 226552 KiB |
| testcase11.txt | AC | 154 ms | 225776 KiB |
| testcase12.txt | AC | 152 ms | 223900 KiB |
| testcase13.txt | AC | 151 ms | 225496 KiB |
| testcase14.txt | AC | 152 ms | 223792 KiB |
| testcase15.txt | AC | 148 ms | 218808 KiB |
| testcase16.txt | AC | 147 ms | 219380 KiB |
| testcase17.txt | AC | 91 ms | 143644 KiB |
| testcase18.txt | AC | 148 ms | 215836 KiB |
| testcase19.txt | AC | 161 ms | 228804 KiB |
| testcase20.txt | AC | 129 ms | 187820 KiB |
| testcase21.txt | AC | 117 ms | 168596 KiB |
| testcase22.txt | AC | 161 ms | 228476 KiB |
| testcase23.txt | AC | 72 ms | 120928 KiB |
| testcase24.txt | AC | 130 ms | 189504 KiB |
| testcase25.txt | AC | 160 ms | 229108 KiB |
| testcase26.txt | AC | 136 ms | 183856 KiB |
| testcase27.txt | AC | 155 ms | 208216 KiB |
| testcase28.txt | AC | 168 ms | 221544 KiB |
| testcase29.txt | AC | 129 ms | 174224 KiB |
| testcase30.txt | AC | 135 ms | 183060 KiB |
| testcase31.txt | AC | 167 ms | 221600 KiB |
| testcase32.txt | AC | 159 ms | 210636 KiB |
| testcase33.txt | AC | 145 ms | 196088 KiB |
| testcase34.txt | AC | 167 ms | 221632 KiB |