結果
問題 | No.2196 Pair Bonus |
ユーザー | McGregorsh |
提出日時 | 2023-01-22 22:38:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 416 ms / 2,000 ms |
コード長 | 1,727 bytes |
コンパイル時間 | 404 ms |
コンパイル使用メモリ | 87,188 KB |
実行使用メモリ | 157,872 KB |
最終ジャッジ日時 | 2023-09-07 06:16:54 |
合計ジャッジ時間 | 7,754 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,272 KB |
testcase_01 | AC | 235 ms
92,168 KB |
testcase_02 | AC | 229 ms
92,264 KB |
testcase_03 | AC | 416 ms
155,624 KB |
testcase_04 | AC | 375 ms
155,348 KB |
testcase_05 | AC | 236 ms
93,072 KB |
testcase_06 | AC | 238 ms
92,864 KB |
testcase_07 | AC | 242 ms
93,012 KB |
testcase_08 | AC | 279 ms
100,924 KB |
testcase_09 | AC | 372 ms
157,872 KB |
testcase_10 | AC | 331 ms
130,956 KB |
testcase_11 | AC | 283 ms
104,884 KB |
testcase_12 | AC | 358 ms
148,804 KB |
testcase_13 | AC | 243 ms
93,012 KB |
testcase_14 | AC | 259 ms
95,112 KB |
testcase_15 | AC | 240 ms
92,852 KB |
testcase_16 | AC | 362 ms
141,760 KB |
testcase_17 | AC | 243 ms
93,192 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) A = i_list() B = i_list() X = i_list() Y = i_list() ans = 0 for i in range(N): a = i * 2 b = i * 2 + 1 score1 = A[a] + A[b] + X[i] score2 = B[a] + B[b] + X[i] score3 = A[a] + B[b] + Y[i] score4 = B[a] + A[b] + Y[i] score = max(score1, score2, score3, score4) ans += score print(ans) if __name__ == '__main__': main()