結果
問題 | No.837 Noelちゃんと星々2 |
ユーザー | McGregorsh |
提出日時 | 2022-07-04 21:19:38 |
言語 | PyPy3 (7.3.13) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,635 bytes |
コンパイル時間 | 2,323 ms |
コンパイル使用メモリ | 86,560 KB |
実行使用メモリ | 124,264 KB |
最終ジャッジ日時 | 2023-08-21 05:40:35 |
合計ジャッジ時間 | 11,103 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 219 ms
92,740 KB |
testcase_10 | AC | 220 ms
92,828 KB |
testcase_11 | WA | - |
testcase_12 | AC | 229 ms
92,796 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 228 ms
92,852 KB |
testcase_16 | AC | 224 ms
92,748 KB |
testcase_17 | WA | - |
testcase_18 | AC | 229 ms
92,704 KB |
testcase_19 | WA | - |
testcase_20 | AC | 224 ms
92,448 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 227 ms
92,604 KB |
testcase_25 | AC | 224 ms
92,700 KB |
testcase_26 | AC | 224 ms
92,460 KB |
testcase_27 | AC | 226 ms
92,816 KB |
testcase_28 | AC | 225 ms
92,692 KB |
testcase_29 | AC | 223 ms
92,796 KB |
testcase_30 | AC | 221 ms
92,752 KB |
testcase_31 | AC | 227 ms
92,504 KB |
testcase_32 | AC | 229 ms
92,652 KB |
ソースコード
import sys, re 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 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()) y = i_list() if len(set(y)) == 1: print(1) exit() y.sort() mae = y[:n//2] usiro = y[n//2:] center_mae = mae[len(mae)//2] center_usiro = usiro[len(usiro)//2] ans = 0 for i in range(n): ans += min(abs(y[i]-center_mae), abs(y[i]-center_usiro)) print(ans) if __name__ == '__main__': main()