Kasat

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
    int tt;
    cin>>tt;
    for(int xx = 0; xx < tt; ++xx) {
        int t[3];
        int n;
        cin>>t[0]>>t[1]>>t[2];
        cin>>n;
        while(n > 0) {
            sort(t, t+3);
            if(t[0] == t[1] && t[1] == t[2]) {
                if(n%2 == 0) {
                    cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
                    goto ohi;
                }
                else {
                    cout<<t[0]-1<<' '<<t[1]<<' '<<t[2]+1<<'\n';
                    goto ohi;
                }
            }
            if(t[0] == t[1] && t[1]+1 == t[2]) {
                cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
                goto ohi;
            }
            if(t[0] == t[1]-1 && t[1] == t[2]) {
                cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
                goto ohi;
            }
            //cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
            if(t[0] == t[1] /*&& abs(t[1] - t[2]) > 10 && n > 10*/) {
                int w = min(n, (t[1]-t[2])/2);
                //cout<<w<<'\n';
                t[0] -= w/2;
                if(w > 0) {
                t[1] -= (w+1)/2;
                }
                else {
                    t[1] -= (w-1)/2;
                }
                t[2] += w;
                n -= w;
                continue;
            }
            if(/*abs(t[1]-t[0]) > 10 && n > 10 && */t[1] == t[2]) {
                int w = min(n, (t[1]-t[0])/2);
                t[0] += w;
                if(w > 0) {
                t[1] -= (w+1)/2;
                }
                else {
                    t[1] -= (w-1)/2;
                }
                t[2] -= w/2;
                n -= w;
                continue;
            }
            int q;
            /*if(n > 10 && t[2] - t[0] > 12)*/ q = min(t[2] - t[1] , t[1] - t[0] );
            //else q = min(t[2] - t[1] + 1, t[1] - t[0] + 1);
            q = min(q, n);
 
            n -= q;
            t[0] += q;
            t[2] -= q;
        }
        sort(t, t+3);
        cout<<t[0]<<' '<<t[1]<<' '<<t[2]<<'\n';
        ohi:;
    }
 
 
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED