結果
問題 | No.2217 Suffix+ |
ユーザー | McGregorsh |
提出日時 | 2023-03-18 13:54:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 338 ms / 2,000 ms |
コード長 | 1,788 bytes |
コンパイル時間 | 165 ms |
コンパイル使用メモリ | 81,788 KB |
実行使用メモリ | 104,648 KB |
最終ジャッジ日時 | 2023-10-18 17:16:36 |
合計ジャッジ時間 | 10,761 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 147 ms
88,588 KB |
testcase_01 | AC | 145 ms
88,584 KB |
testcase_02 | AC | 145 ms
88,588 KB |
testcase_03 | AC | 146 ms
88,584 KB |
testcase_04 | AC | 147 ms
88,592 KB |
testcase_05 | AC | 148 ms
88,588 KB |
testcase_06 | AC | 145 ms
88,592 KB |
testcase_07 | AC | 146 ms
88,592 KB |
testcase_08 | AC | 147 ms
88,584 KB |
testcase_09 | AC | 144 ms
88,584 KB |
testcase_10 | AC | 144 ms
88,588 KB |
testcase_11 | AC | 148 ms
88,588 KB |
testcase_12 | AC | 146 ms
88,584 KB |
testcase_13 | AC | 146 ms
88,592 KB |
testcase_14 | AC | 159 ms
90,596 KB |
testcase_15 | AC | 157 ms
90,264 KB |
testcase_16 | AC | 169 ms
95,732 KB |
testcase_17 | AC | 161 ms
92,460 KB |
testcase_18 | AC | 160 ms
91,812 KB |
testcase_19 | AC | 278 ms
99,944 KB |
testcase_20 | AC | 265 ms
98,416 KB |
testcase_21 | AC | 168 ms
89,328 KB |
testcase_22 | AC | 276 ms
99,796 KB |
testcase_23 | AC | 248 ms
96,060 KB |
testcase_24 | AC | 192 ms
104,464 KB |
testcase_25 | AC | 192 ms
104,460 KB |
testcase_26 | AC | 196 ms
104,460 KB |
testcase_27 | AC | 191 ms
104,456 KB |
testcase_28 | AC | 191 ms
104,460 KB |
testcase_29 | AC | 323 ms
104,396 KB |
testcase_30 | AC | 318 ms
104,404 KB |
testcase_31 | AC | 318 ms
104,396 KB |
testcase_32 | AC | 324 ms
104,396 KB |
testcase_33 | AC | 324 ms
104,404 KB |
testcase_34 | AC | 194 ms
104,648 KB |
testcase_35 | AC | 147 ms
88,592 KB |
testcase_36 | AC | 338 ms
104,504 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, K = i_map() A = i_list() top = 10 ** 18 under = 0 while top - under > 1: mid = (top + under) // 2 now = 0 count = 0 for i in range(N): point = mid - (now + A[i]) if point > 0: score = int(ceil(point / (i+1))) now += score * (i+1) count += score if count <= K: under = mid else: top = mid print(under) if __name__ == '__main__': main()