Kasat

import java.util.Arrays;
import java.util.Scanner;
 
 
public class Main {
	
	public static void ratkaise(int[] lista, int n) {
		Arrays.sort(lista);
		int ka = (lista[0] + lista[1] + lista[2])/3;
		int mod = (lista[0] + lista[1] + lista[2])%3;
		
		int ai = ka, bi = ka, ci = ka;
		if(mod > 0) ci++;
		if(mod > 1) bi++;
		
		
		if(lista[1] < bi) {
			int diff = lista[1] - lista[0];
			if(diff <= n) {
				lista[0] += diff;
				lista[2] -= diff;
				n -= diff;
				int m = Math.min(lista[2] - ci, n);
				lista[0] += m/2;
				lista[1] += m/2 + m%2;
				lista[2] -= m;
				n -= m;
			} else {
				lista[0] += n;
				lista[2] -= n;
				n = 0;
			}
		} else if(lista[1] > bi) {
			int diff = lista[2] - lista[1];
			if(diff <= n) {
				lista[0] += diff;
				lista[2] -= diff;
				n -= diff;
				int m = ai - lista[0];
				lista[0] += Math.min(m, n);
				lista[1] -= Math.min(m, n)/2;
				lista[2] -= Math.min(m, n)/2 + Math.min(m, n)%2;
				n -= m;
			} else {
				lista[0] += n;
				lista[2] -= n;
				n = 0;
			}
		}  else {
			int m = Math.min(ai - lista[0], n);
			lista[0] += m;
			lista[2] -= m;
			n -= m;
		}
		
		if(mod == 0) {
			if(n % 2 != 0) {
				lista[0]--;
				lista[2]++;
			}
		}
		
		Arrays.sort(lista);
	}
	
	public static void tulosta(int[] lista) {
		System.out.println(lista[0] + " "+ lista[1] + " " + lista[2]);
	}
 
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		
		int t = input.nextInt();
		int[][] taulukko = new int[t][3];
		int[] ns = new int[t];
		
		for (int i = 0; i < t; i++) {
			taulukko[i][0] = input.nextInt();
			taulukko[i][1] = input.nextInt();
			taulukko[i][2] = input.nextInt();
			ns[i] = input.nextInt();
		}
		
		for (int i = 0; i < t; i++) {
			ratkaise(taulukko[i], ns[i]);
			tulosta(taulukko[i]);
		}
		
		input.close();
	}
 
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: WRONG ANSWER