結果
問題 | No.91 赤、緑、青の石 |
ユーザー | McGregorsh |
提出日時 | 2022-06-15 13:35:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 128 ms / 5,000 ms |
コード長 | 1,944 bytes |
コンパイル時間 | 154 ms |
コンパイル使用メモリ | 82,324 KB |
実行使用メモリ | 83,888 KB |
最終ジャッジ日時 | 2024-04-14 21:55:42 |
合計ジャッジ時間 | 5,447 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 120 ms
83,688 KB |
testcase_01 | AC | 118 ms
83,684 KB |
testcase_02 | AC | 120 ms
83,288 KB |
testcase_03 | AC | 118 ms
83,692 KB |
testcase_04 | AC | 121 ms
83,652 KB |
testcase_05 | AC | 119 ms
83,632 KB |
testcase_06 | AC | 123 ms
83,660 KB |
testcase_07 | AC | 120 ms
83,292 KB |
testcase_08 | AC | 119 ms
83,308 KB |
testcase_09 | AC | 120 ms
83,420 KB |
testcase_10 | AC | 121 ms
83,640 KB |
testcase_11 | AC | 120 ms
83,688 KB |
testcase_12 | AC | 121 ms
83,412 KB |
testcase_13 | AC | 119 ms
83,480 KB |
testcase_14 | AC | 119 ms
83,484 KB |
testcase_15 | AC | 122 ms
83,612 KB |
testcase_16 | AC | 121 ms
83,448 KB |
testcase_17 | AC | 118 ms
83,420 KB |
testcase_18 | AC | 122 ms
83,380 KB |
testcase_19 | AC | 120 ms
83,568 KB |
testcase_20 | AC | 120 ms
83,244 KB |
testcase_21 | AC | 119 ms
83,560 KB |
testcase_22 | AC | 123 ms
83,588 KB |
testcase_23 | AC | 119 ms
83,300 KB |
testcase_24 | AC | 128 ms
83,888 KB |
testcase_25 | AC | 119 ms
83,276 KB |
testcase_26 | AC | 120 ms
83,608 KB |
testcase_27 | AC | 121 ms
83,568 KB |
testcase_28 | AC | 120 ms
83,576 KB |
testcase_29 | AC | 120 ms
83,284 KB |
testcase_30 | AC | 120 ms
83,320 KB |
testcase_31 | AC | 118 ms
83,656 KB |
ソースコード
import sys, re 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): r, g, b = i_map() top = 10**18 under = 0 while top - under > 1: mid = (top+under)//2 r_tarinai = 0 g_tarinai = 0 b_tarinai = 0 r_amaru = 0 g_amaru = 0 b_amaru = 0 if r > mid: r_amaru += r - mid else: r_tarinai = mid - r if g > mid: g_amaru += g - mid else: g_tarinai = mid - g if b > mid: b_amaru += b - mid else: b_tarinai = mid - b total_tarinai = r_tarinai + g_tarinai + b_tarinai total_amaru = r_amaru//2 + g_amaru//2 + b_amaru//2 if total_tarinai <= total_amaru: under = mid else: top = mid print(under) if __name__ == '__main__': main()