Omenat

#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <time.h>
 
int main() {
	clock_t c0 = clock();
	std::mt19937 gen;
	int n;
	std::cin >> n;
	std::vector<int> p(n), a(n), a0;
	a.reserve(n);
	a0.reserve(n);
	long e = 0;
	for (int i = 0; i < n; ++i) {
		std::cin >> p[i];
		a[i] = p[i];
		e += p[i];
	}
	e /= 2;
	a0 = a;
	long e0 = e;
	while (e0 != 0 && (clock() - c0) * 1.0 / CLOCKS_PER_SEC < 0.945) {
		for (int i = 0; i < 200000; ++i) {
			for (int j = a.size(); j--;) {
				std::swap(a[j], a[gen() % a.size()]);
			}
			for (int& j: a) {
				if ((e < 0) == (j < 0)) {
					e -= j;
					j = -j;
				}
				if (std::abs(e) < e0) {
					e0 = std::abs(e);
					a0 = a;
					if (e0 == 0) {
						goto done;
					}
				}
			}
		}
	}
	done:
	for (int i: p) {
		auto j = std::find(a0.begin(), a0.end(), i);
		if (j != a0.end()) {
			a0.erase(j);
			std::cout << "1 ";
		} else {
			std::cout << "2 ";
		}
	}
	std::cout << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: ACCEPTED