求条样例输出 159 -10

#include <bits/stdc++.h>
using namespace std;

int n;
vector<pair<int, int> > m;

int main() {
	//freopen("lucky.in", "r", stdin);
	//freopen("lucky.out", "w", stdout);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		int op, x, y, w;
		cin >> op;
		if (op == 1) {
			cin >> x >> y >> w;
			m.push_back({x, w});
			m.push_back({y + 1, w});
		} else if (op == 2) {
			cin >> x >> w;
			m.push_back({x, w});
			m.push_back({y + 1, w});
		} else if (op == 3) {
			cin >> x >> w;
			m.push_back({-1e9, w});
			m.push_back({x, w});
			m.push_back({x + 2, w});
			m.push_back({1e9, w});
		}
	}
	sort(m.begin(), m.end());
	int maxn = INT_MIN;
	int tmp;
	int sum = 0;
	int l, r;
	for (int i = 1; i <= n; i = tmp) {
		tmp = i;
		while (m[i].first == m[tmp].first) {
			sum ^= m[tmp].second;
			tmp++;
		}
		if (maxn < sum) {
			maxn = sum;
			l = m[i].first;
			r = m[tmp].first - 1;
		} else if (maxn == sum) {
			int lr1 = (abs(m[i].first) > abs(m[tmp].first - 1) ? m[i].first : m[tmp].first);
			int lr2 = (abs(l) > abs(r) ? l : r);
			if (abs(lr1) < abs(lr2)) {
				l = m[i].first;
				r = m[tmp].first - 1;
			} else if (abs(lr1) == abs(lr2) && lr1 != lr2) {
				if (lr2 < 0) {
					l = m[i].first;
					r = m[tmp].first - 1;
				}
			}
		}
	}
	cout << maxn << " " << (abs(l) > abs(r) ? l : r);
	return 0;
}