| Task: | Kasat |
| Sender: | |
| Submission time: | 2015-09-13 22:31:27 +0300 |
| Language: | Python3 |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.09 s | 1 | details |
| #2 | WRONG ANSWER | 0.10 s | 2 | details |
| #3 | WRONG ANSWER | 0.10 s | 3 | details |
Code
t = int(input())
while t > 0:
a, b, c, n = (int(x) for x in input().split())
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:
if D[1]-D[0] > 0:
d = min(D[1]-D[0], n)
D = [int(D[0]+d), int(D[1]-(d+1)/2), int(D[2]-(d/2))]
n = n - d
elif D[2]-D[1] > 0:
d = min(D[2]-D[1], n)
D = [int(D[0]+d/2), int(D[1]+(d+1)/2), int(D[2]-d)]
n = n - d
D.sort()
if n % 2:
D = sorted([D[0]+1, D[1], D[2]-1])
print(" ".join(str(x) for x in D))
t = t - 1
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 1000 7 69 64 45 37 5 30 81 50 49 37 38 46 37 100 6 ... |
| correct output |
|---|
| 46 47 47 24 24 24 45 45 46 43 46 94 32 32 33 ... |
| user output |
|---|
| 43 44 52 20 21 30 43 43 49 43 46 94 30 31 35 ... |
Test 2
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 19 13 88 978977859 67 57 39 960003440 81 16 67 971611942 92 96 2 957979201 ... |
| correct output |
|---|
| 39 40 41 54 54 55 54 55 55 63 63 64 36 37 38 ... |
| user output |
|---|
| 19 50 51 52 53 57 48 49 66 49 49 91 34 34 42 ... |
Test 3
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 211358104 753479603 549127067 ... |
| correct output |
|---|
| 504654924 504654925 504654925 589019272 589019272 589019273 101309993 101309994 101309994 436205296 436205297 436205298 351062567 351062568 351062568 ... |
| user output |
|---|
| 482418853 482418853 549127067 484871127 484871128 797315561 81456542 81456542 141016896 363953322 472331284 472331285 302554812 302554812 448078078 ... |