結果
問題 | No.817 Coin donation |
ユーザー | McGregorsh |
提出日時 | 2023-07-07 13:42:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 374 ms / 2,000 ms |
コード長 | 1,728 bytes |
コンパイル時間 | 301 ms |
コンパイル使用メモリ | 87,128 KB |
実行使用メモリ | 100,888 KB |
最終ジャッジ日時 | 2023-09-28 14:10:18 |
合計ジャッジ時間 | 6,963 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 245 ms
89,576 KB |
testcase_01 | AC | 244 ms
89,632 KB |
testcase_02 | AC | 244 ms
89,720 KB |
testcase_03 | AC | 247 ms
89,488 KB |
testcase_04 | AC | 244 ms
89,684 KB |
testcase_05 | AC | 274 ms
91,024 KB |
testcase_06 | AC | 273 ms
92,260 KB |
testcase_07 | AC | 282 ms
92,348 KB |
testcase_08 | AC | 335 ms
98,524 KB |
testcase_09 | AC | 279 ms
92,524 KB |
testcase_10 | AC | 372 ms
100,852 KB |
testcase_11 | AC | 374 ms
100,812 KB |
testcase_12 | AC | 364 ms
100,888 KB |
testcase_13 | AC | 244 ms
89,796 KB |
testcase_14 | AC | 243 ms
89,796 KB |
testcase_15 | AC | 244 ms
89,852 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math 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, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N, K = i_map() nums = [i_list() for i in range(N)] top = 10 ** 10 under = 0 while top - under > 1: mid = (top + under) // 2 count = 0 for i in range(N): l, r = nums[i] if r <= mid: cost = r - l + 1 count += cost else: if l <= mid: cost = mid - l + 1 count += cost if count >= K: top = mid else: under = mid print(top) if __name__ == '__main__': main()