結果
問題 | No.2233 Average |
ユーザー | McGregorsh |
提出日時 | 2023-03-17 00:28:31 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 382 ms / 2,000 ms |
コード長 | 1,736 bytes |
コンパイル時間 | 188 ms |
コンパイル使用メモリ | 81,716 KB |
実行使用メモリ | 89,984 KB |
最終ジャッジ日時 | 2023-10-18 13:21:29 |
合計ジャッジ時間 | 5,699 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
88,440 KB |
testcase_01 | AC | 142 ms
88,436 KB |
testcase_02 | AC | 139 ms
88,436 KB |
testcase_03 | AC | 138 ms
88,436 KB |
testcase_04 | AC | 140 ms
88,440 KB |
testcase_05 | AC | 140 ms
88,436 KB |
testcase_06 | AC | 142 ms
88,436 KB |
testcase_07 | AC | 144 ms
88,680 KB |
testcase_08 | AC | 292 ms
89,984 KB |
testcase_09 | AC | 360 ms
89,892 KB |
testcase_10 | AC | 280 ms
89,896 KB |
testcase_11 | AC | 279 ms
89,888 KB |
testcase_12 | AC | 261 ms
89,888 KB |
testcase_13 | AC | 186 ms
89,584 KB |
testcase_14 | AC | 278 ms
89,892 KB |
testcase_15 | AC | 316 ms
89,888 KB |
testcase_16 | AC | 205 ms
89,892 KB |
testcase_17 | AC | 217 ms
89,892 KB |
testcase_18 | AC | 382 ms
89,892 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(): T = int(input()) for i in range(T): a, b, c, K = i_map() if a == b == c: print(a+b+c) continue now = 0 while now < K: na = (b + c) // 2 nb = (c + a) // 2 nc = (a + b) // 2 now += 1 a = na b = nb c = nc if a == b == c: break print(a+b+c) if __name__ == '__main__': main()