Kasat

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> test(int a, int b, int c, int n) {
	vector<int> num = { a,b,c };
	sort(num.begin(), num.end());

	while (num[0] + 1 < num[2] && n > 10) {
		if (num[0] == num[1] && num[0] + 3 <= num[2]) {
			int d = num[2] - num[0];

			if (n < 2 * (d / 3)) d = 3 * n / 2;

			num[0] += d / 3;
			num[1] += d / 3;
			num[2] -= 2 * (d / 3);

			n -= 2 * (d / 3);
		}
		else if (num[1] == num[2] && num[0] + 3 <= num[2]) {
			int d = num[2] - num[0];

			if (n < 2 * (d / 3)) d = 3 * n / 2;

			num[0] += 2 * (d / 3);
			num[1] -= d / 3;
			num[2] -= d / 3;

			n -= 2 * (d / 3);
		}
		else {
			int d = min(num[2] - num[1], num[1] - num[0]);
			if (d > n) d = n;
			num[2] -= d;
			num[0] += d;
			n -= d;
		}
		sort(num.begin(), num.end());
	}

	while (n > 0) {
		if (num[0] == num[1] && num[1] == num[2]) {
			if (n % 2 == 0) {
				return num;
			}
			else {
				num[0]--;
				num[2]++;
				return num;
			}
		}
		if (num[0] == num[1] && num[1] + 1 == num[2]) {
			return num;
		}
		if (num[0] + 1 == num[1] && num[1] == num[2]) {
			return num;
		}

		num[2]--;
		num[0]++;
		n--;
		sort(num.begin(), num.end());
	}

	return num;
}

int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; i++) {
		int a, b, c, n;
		cin >> a >> b >> c >> n;
		auto r = test(a, b, c, n);
		cout << r[0] << " " << r[1] << " " << r[2] << "\n";
	}
}

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED