1196C - Robot Breakout - CodeForces Solution

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
struct DSU {
	int size;
	int componentCount;
	int* parent;
	int* height;

	DSU(int _size) {
		size = _size;
		componentCount = size;
		parent = new int[size];
		height = new int[size];

		for (int i = 0; i < size; i++) {
			parent[i] = i;
			height[i] = 1;
		}
	}

	int getRep(int a) {
		int tmp = a;
		while (parent[tmp] != tmp) {
			tmp = parent[tmp];
		}
		parent[a] = tmp;
		return tmp;
	}

	void connect(int a, int b) {
		a = getRep(a), b = getRep(b);
		if (a == b) return;
		if (height[a] < height[b]) {
			parent[a] = b;
		}
		else if (height[b] < height[a]) {
			parent[b] = a;
		}
		else {
			height[a]++;
			parent[b] = a;
		}
		componentCount--;
	}
};
long long binPow(long long x, long long y, long long mod) {
	if (y == 0ll) return 1ll;

	long long tmp = binPow(x, y / 2ll, mod);
	if (y % 2ll == 0ll) return (tmp * tmp) % mod;
	else return (((x * tmp) %mod) * tmp) % mod;
}

void solve() {
	int n;
	cin >> n;

	//x y left up right down

	vector<vector<int>> robots(n, vector<int>(6));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 6; j++) {
			cin >> robots[i][j];
		}
	}

	int l = -100000, u = 100000, d = -100000, r = 100000;
	for (int i = 0; i < n; i++) {
		int _l = (robots[i][2] ? -100000 : robots[i][0]);
		int _u = (robots[i][3] ? 100000 : robots[i][1]);
		int _r = (robots[i][4] ? 100000 : robots[i][0]);
		int _d = (robots[i][5] ? -100000 : robots[i][1]);

		l = max(l, _l);
		u = min(u, _u);
		r = min(r, _r);
		d = max(d, _d);
	}

	//cout << "*** ";

	if (l > r || d > u) {
		cout << "0\n";
		return;
	}

	cout << "1 " << l << " " << u << "\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	bool unlimited = true;

	if (unlimited) {
		int t;
		cin >> t;
		while (t--) solve();
	}
	else {
		solve();
	}

	return 0;
}