結果
問題 | No.198 キャンディー・ボックス2 |
ユーザー | McGregorsh |
提出日時 | 2023-05-14 23:47:31 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,852 bytes |
コンパイル時間 | 323 ms |
コンパイル使用メモリ | 87,076 KB |
実行使用メモリ | 92,644 KB |
最終ジャッジ日時 | 2023-08-20 08:39:32 |
合計ジャッジ時間 | 10,132 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 277 ms
91,900 KB |
testcase_01 | AC | 272 ms
92,144 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 242 ms
92,176 KB |
testcase_10 | AC | 233 ms
92,156 KB |
testcase_11 | AC | 237 ms
92,168 KB |
testcase_12 | AC | 235 ms
92,108 KB |
testcase_13 | WA | - |
testcase_14 | AC | 234 ms
92,032 KB |
testcase_15 | AC | 234 ms
91,948 KB |
testcase_16 | AC | 232 ms
91,976 KB |
testcase_17 | AC | 238 ms
92,144 KB |
testcase_18 | AC | 235 ms
92,012 KB |
testcase_19 | AC | 231 ms
92,188 KB |
testcase_20 | AC | 236 ms
92,156 KB |
testcase_21 | AC | 235 ms
92,160 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 240 ms
92,004 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(): B = int(input()) N = int(input()) A = [int(input()) for i in range(N)] top = 10 ** 18 under = 0 while top - under > 1: mid = (top + under) // 2 cost = 0 cou = 0 for i in range(N): if A[i] > mid: cost += A[i] - mid else: cou += mid - A[i] if cost >= cou: under = mid else: top = mid ans = 0 for i in range(N): ans += abs(A[i] - under) print(ans) if __name__ == '__main__': main()