''' C. Water the Trees
https://codeforces.com/contest/1661/problem/C
'''
import io, os, sys
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline output = sys.stdout.write
DEBUG = os.environ.get('debug') not in [None, '0']
if DEBUG:
from inspect import currentframe, getframeinfo
from re import search
def debug(*args):
if not DEBUG: return
frame = currentframe().f_back
s = getframeinfo(frame).code_context[0]
r = search(r"\((.*)\)", s).group(1)
vnames = r.split(', ')
var_and_vals = [f'{var}={val}' for var, val in zip(vnames, args)]
prefix = f'{currentframe().f_back.f_lineno:02d}: '
print(f'{prefix}{", ".join(var_and_vals)}')
INF = float('inf')
def solve(N, A):
res = INF
mx = max(A)
for m in [mx, mx + 1]:
two = one = 0
for a in A:
two += (m - a) // 2
one += (m - a) % 2
if two - one >= 2:
t = (two - one + 1) // 3
one += 2 * t
two -= t
if two < one: res = min(res, one * 2 - 1)
elif two == one: res = min(res, one * 2)
elif two == one + 1: res = min(res, two * 2)
else: assert False
return res
def main():
T = int(input())
for _ in range(T):
N = int(input())
A = list(map(int, input().split()))
out = solve(N, A)
print(out)
if __name__ == '__main__':
main()
841. Keys and Rooms | 152. Maximum Product Subarray |
337. House Robber III | 869. Reordered Power of 2 |
1593C - Save More Mice | 1217. Minimum Cost to Move Chips to The Same Position |
347. Top K Frequent Elements | 1503. Last Moment Before All Ants Fall Out of a Plank |
430. Flatten a Multilevel Doubly Linked List | 1290. Convert Binary Number in a Linked List to Integer |
1525. Number of Good Ways to Split a String | 72. Edit Distance |
563. Binary Tree Tilt | 1306. Jump Game III |
236. Lowest Common Ancestor of a Binary Tree | 790. Domino and Tromino Tiling |
878. Nth Magical Number | 2099. Find Subsequence of Length K With the Largest Sum |
1608A - Find Array | 416. Partition Equal Subset Sum |
1446. Consecutive Characters | 1618A - Polycarp and Sums of Subsequences |
1618B - Missing Bigram | 938. Range Sum of BST |
147. Insertion Sort List | 310. Minimum Height Trees |
2110. Number of Smooth Descent Periods of a Stock | 2109. Adding Spaces to a String |
2108. Find First Palindromic String in the Array | 394. Decode String |