Kasat

#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <utility>
#include <algorithm>
 
using namespace std;
typedef long long LL;
 
void print(vector<LL> & V){
	//&sort(V.begin(), V.end(), [](const pair<LL,LL> x, const pair<LL,LL> y){
	//	return x.second < y.second;});
	sort(V.begin(), V.end());
	for(auto p : V) cout << p << " ";
	cout << endl;
}
 
void run(vector<LL> & v, int n){
	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){
	LL m = (a+b+c)/3;
	LL d = abs(a-m) + abs(b-m) + abs(c-m);
	
	vector<LL> v = {a,b,c};
	sort(v.begin(), v.end());
	
	if(n >= d/2){
		LL d0 = m-v[0];
		LL d1 = m-v[1];
		v[0] += d0;
		v[2] -= d0;
		
		v[1] += d1;
		v[2] -= d1;
		
		n -= d0 + d1;
		n = n % 2;
		run(v,1);
		print(v);
		return;
	}
	
	LL x = v[1] - v[0];
	if(x >= n){
		v[2] -= n;
		v[0] += n;
		print(v); return;
	}
	else{
		
		v[2] -= x;
		v[0] += x;
		n -= x;
		// Now v[0] == v[1], n > 0
		
		v[2] -= n;
		v[1] += n/2;
		v[2]+= n/2;
		n = n % 2;
		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