Kasat

def f(a, b, c, n):
    D = sorted([a,b,c])
    d = min(D[1]-D[0], D[2]-D[1], n)
    D = [D[0]+d, D[1], D[2]-d]
    n = n - d

    if n > 0:
        #print("|" + " ".join(str(x) for x in D))
        d = int(n / 2)
        while d > 10:
            while n >= 10*d and D[2]-D[0] >= 3*d:
                if D[0] < D[1]:
                    D = [D[0]+2*d, D[1]-1*d, D[2]-1*d]
                else:
                    D = [D[0]+2*d, D[1]-1*d, D[2]-1*d]
                n = n - 2*d
            d = int(d / 2)
        #print("|" + " ".join(str(x) for x in D))
        while n > 0:
            D = sorted([D[0]+1, D[1], D[2]-1])
            n = n - 1

    return D

def triv(a, b, c, n):
    D = sorted([a,b,c])
    d = min(D[1]-D[0], D[2]-D[1], n)
    D = [D[0]+d, D[1], D[2]-d]
    n = n - d
    while n > 0:
        D = sorted([D[0]+1, D[1], D[2]-1])
        n = n - 1
    return D

for t in range(int(input())):
    a, b, c, n = (int(x) for x in input().split())
    print(" ".join(str(x) for x in triv(a, b, c, n)))

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED