Kasat

#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <utility>
#include <algorithm>

using namespace std;
typedef long long LL;

#define min(a,b) (a < b ? a : b)

void print(vector<LL> & V){
	sort(V.begin(), V.end());
	for(auto p : V) cout << p << " ";
	cout << endl;
}

void run(vector<LL> & v, int n){
	sort(v.begin(), v.end());
	while(true){
		if(n == 0) return;
		v[0]++; v[2]--;
		sort(v.begin(), v.end());
		n--;
	}
}

void solve(LL a, LL b, LL c, LL n){
	
	/* ÄLÄ KYSY MITEN TÄHÄN KOODIN ON PÄÄDYTTY :Dd*/
	
	if(a == b && b == c){
		if(n % 2 == 1)
			cout << a-1 << " " << b << " " << c + 1 << endl;
		else
			cout << a << " " << a << " " << a << endl;
		return;
	}
	


	vector<LL> v = {a,b,c};
	sort(v.begin(), v.end());
	a = v[2]; b = v[1]; c = v[0];
	// a >= b >= c
	LL d = min(min(a-b,b-c),n);
	a -= d; c += d; n -= d;
	LL z = a-c;
	LL k = min(n/2, z/3);
	if(a == b){
		a -= k; b -= k;
		c += 2*k;
	}
	else{
		a -= 2*k;
		b += k; c += k;
	}
	
	n -= 2*k;
	v = {a,b,c};
	run(v,min(n,10));
	n -= min(n,10);
	n %= 2;
	run(v,n);
	print(v);
	
}

int main(){
	LL t; cin >> t;
	while(t--){
		LL a,b,c,n; cin >> a >> b >> c >> n;
		solve(a,b,c,n);
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED