結果
問題 | No.2029 Swap Min Max Min |
ユーザー | McGregorsh |
提出日時 | 2022-08-05 23:28:14 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,895 bytes |
コンパイル時間 | 1,404 ms |
コンパイル使用メモリ | 86,784 KB |
実行使用メモリ | 123,400 KB |
最終ジャッジ日時 | 2023-10-14 01:27:47 |
合計ジャッジ時間 | 17,711 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 229 ms
92,096 KB |
testcase_01 | AC | 231 ms
92,192 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 261 ms
103,420 KB |
testcase_06 | AC | 276 ms
118,012 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 237 ms
97,144 KB |
testcase_11 | WA | - |
testcase_12 | AC | 247 ms
107,000 KB |
testcase_13 | WA | - |
testcase_14 | AC | 274 ms
123,068 KB |
testcase_15 | WA | - |
testcase_16 | AC | 288 ms
122,768 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 276 ms
122,964 KB |
testcase_20 | AC | 280 ms
123,128 KB |
testcase_21 | AC | 275 ms
122,648 KB |
testcase_22 | AC | 281 ms
122,892 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 275 ms
123,112 KB |
testcase_26 | AC | 279 ms
123,312 KB |
testcase_27 | WA | - |
testcase_28 | AC | 240 ms
92,156 KB |
testcase_29 | AC | 238 ms
91,940 KB |
testcase_30 | AC | 238 ms
91,944 KB |
testcase_31 | AC | 240 ms
92,144 KB |
testcase_32 | WA | - |
testcase_33 | AC | 238 ms
92,052 KB |
testcase_34 | WA | - |
testcase_35 | AC | 237 ms
92,120 KB |
testcase_36 | AC | 236 ms
91,820 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 287 ms
122,924 KB |
testcase_40 | AC | 274 ms
119,520 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | AC | 282 ms
122,920 KB |
testcase_44 | WA | - |
ソースコード
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 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() line = n // 2 nums = [] for i in range(n): if a[i] <= line: nums.append(i) if n % 2 == 0: ans = 0 for i, num in enumerate(nums): print(num) point1 = i * 2 point2 = i * 2 + 1 ans += min(abs(num - point1), abs(num - point2)) print(line, ans) else: ans = 0 line1 = [i for i in range(1, n, 2)] for i in range(n//2): ans += abs(nums[i] - line1[i]) print(line, ans) if __name__ == '__main__': main()