結果
問題 | No.851 テストケース |
ユーザー | McGregorsh |
提出日時 | 2023-04-13 14:00:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 131 ms / 3,153 ms |
コード長 | 1,681 bytes |
コンパイル時間 | 143 ms |
コンパイル使用メモリ | 82,296 KB |
実行使用メモリ | 89,848 KB |
最終ジャッジ日時 | 2024-04-17 17:51:05 |
合計ジャッジ時間 | 3,605 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
89,444 KB |
testcase_01 | AC | 115 ms
89,448 KB |
testcase_02 | AC | 131 ms
89,580 KB |
testcase_03 | AC | 119 ms
89,636 KB |
testcase_04 | AC | 117 ms
89,724 KB |
testcase_05 | AC | 114 ms
89,172 KB |
testcase_06 | AC | 115 ms
89,436 KB |
testcase_07 | AC | 114 ms
89,224 KB |
testcase_08 | AC | 114 ms
89,528 KB |
testcase_09 | AC | 113 ms
89,572 KB |
testcase_10 | AC | 117 ms
89,300 KB |
testcase_11 | AC | 123 ms
89,672 KB |
testcase_12 | AC | 124 ms
89,848 KB |
testcase_13 | AC | 113 ms
89,176 KB |
testcase_14 | AC | 113 ms
89,424 KB |
testcase_15 | AC | 114 ms
89,360 KB |
testcase_16 | AC | 116 ms
89,588 KB |
testcase_17 | AC | 118 ms
89,592 KB |
testcase_18 | AC | 114 ms
89,484 KB |
testcase_19 | AC | 115 ms
89,400 KB |
testcase_20 | AC | 115 ms
89,588 KB |
testcase_21 | AC | 115 ms
89,556 KB |
testcase_22 | AC | 114 ms
89,432 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() if len(A) > 1: print('"assert"') exit() nums = [int(input()) for i in range(N-1)] B = nums[0] C = nums[1] A = A[0] score = set() score.add(A + B) score.add(A + C) score.add(B + C) score = list(score) score.sort(reverse=True) print(score[1]) if __name__ == '__main__': main()