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;
	}
	
	LL m = (a+b+c)/3;
	if((a+b+c)%3 != 0) m++;
	
	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(n,a - m);
	n -= d;
	
	a -= d;
	LL d2 = min(b-c, d);
	c += d2;
	d -= d2;
	
	b += d/2;
	c += d/2; if(d % 2 == 1) c++;
	
	v = {a,b,c};
	run(v,min(10,n));
	n -= min(10,n);
	n %= 2;	
	if(n == 1){
		run(v,1);
	}
	print(v);
	return;
	

}

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: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER