C++ 解法, 执行用时: 1612ms, 内存消耗: 4200K, 提交时间: 2021-12-08 23:16:20

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

const int N = 2e5 + 5;

struct node {
	int l, r, id;
	node() {}
	node(int lx, int rx, int idx) {l = lx, r = rx, id = idx;}
};
node rec[N];
bool cmp(node a, node b) {
	if (a.r == b.r) return a.l < b.l;
	else return a.r < b.r;
}
int sg[N], n, m, cnt[N], now_sg, l = 1, r = 0;

void rm(int pos) {
	int now = sg[pos];
	cnt[now]--;
	if (cnt[now] == 0)  now_sg = min(now_sg, now);
}

void add(int pos) {
	int now = sg[pos];
	cnt[now]++;
	while (cnt[now_sg]) now_sg++;
}

int main(void) {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i < n; i++) {
		cin >> rec[i].l >> rec[i].r;
		rec[i].id = i + 1;
	}
	sort(rec + 1, rec + n, cmp);
	for (int i = 1; i < n; i++) {
		int ql = rec[i].l, qr = rec[i].r, qid = rec[i].id;
		while (r < qr) add(++r);
		while (l > ql) add(--l);
		while (r > qr) rm(r--);
		while (l < ql) rm(l++);
		sg[qid] = now_sg;
	}
	cin >> m;
	for (int i = 1, x, v; i <= m; i++) {
		int ans = 0;
		cin >> x;
		for (int j = 1; j <= x; j++) {
			cin >> v;
			ans ^= sg[v];
		}
		cout << ans << '\n';
	}
	return 0;
}