結果
問題 | No.1808 Fullgold Alchemist |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 13:55:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 308 ms / 2,000 ms |
コード長 | 1,823 bytes |
コンパイル時間 | 456 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 122,952 KB |
最終ジャッジ日時 | 2023-09-23 19:35:52 |
合計ジャッジ時間 | 16,089 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
92,240 KB |
testcase_01 | AC | 241 ms
92,260 KB |
testcase_02 | AC | 241 ms
92,388 KB |
testcase_03 | AC | 239 ms
92,332 KB |
testcase_04 | AC | 238 ms
92,052 KB |
testcase_05 | AC | 274 ms
120,488 KB |
testcase_06 | AC | 297 ms
116,684 KB |
testcase_07 | AC | 280 ms
116,688 KB |
testcase_08 | AC | 294 ms
119,164 KB |
testcase_09 | AC | 301 ms
119,712 KB |
testcase_10 | AC | 289 ms
119,488 KB |
testcase_11 | AC | 308 ms
119,600 KB |
testcase_12 | AC | 286 ms
122,864 KB |
testcase_13 | AC | 297 ms
122,952 KB |
testcase_14 | AC | 305 ms
122,640 KB |
testcase_15 | AC | 307 ms
122,748 KB |
testcase_16 | AC | 244 ms
92,944 KB |
testcase_17 | AC | 235 ms
92,000 KB |
testcase_18 | AC | 246 ms
96,008 KB |
testcase_19 | AC | 234 ms
92,944 KB |
testcase_20 | AC | 244 ms
98,564 KB |
testcase_21 | AC | 236 ms
93,292 KB |
testcase_22 | AC | 236 ms
92,392 KB |
testcase_23 | AC | 245 ms
93,052 KB |
testcase_24 | AC | 237 ms
93,044 KB |
testcase_25 | AC | 244 ms
92,932 KB |
testcase_26 | AC | 243 ms
95,428 KB |
testcase_27 | AC | 249 ms
97,008 KB |
testcase_28 | AC | 302 ms
115,344 KB |
testcase_29 | AC | 263 ms
100,612 KB |
testcase_30 | AC | 255 ms
99,672 KB |
testcase_31 | AC | 298 ms
113,592 KB |
testcase_32 | AC | 269 ms
107,600 KB |
testcase_33 | AC | 287 ms
114,644 KB |
testcase_34 | AC | 300 ms
115,448 KB |
testcase_35 | AC | 279 ms
111,960 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 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, m = i_map() A = i_list() top = 10**18 under = 0 while top - under > 1: mid = (top + under) // 2 cou = 0 juge = True for i in range(n): if A[i] >= mid: cou += A[i] - mid else: cou += A[i] - mid if cou < 0: juge = False break if juge: under = mid else: top = mid print(under // m) if __name__ == '__main__': main()