[hihocoder1236] Scores [k维偏序&强制在线][bitset&分块]

[$\mathfrak{L}\mathfrak{i}\mathfrak{n}\mathfrak{k}$]

---

把维度分开来各个单独处理。
按照权值排序，记录前缀和（到某个（按权值排序后的）位置，每个数是否出现）
查询的时候二分即可。

这样太慢了，所以考虑 bitset
还是慢 所以把前缀和的部分再分块

---

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<cmath>
#include<cstring>
#include<cctype>
#include<bitset>
using namespace std;
#define R register
const int MAXN = 50005;
const int MAXS = 305;
struct pt
{
	int val, id;
	pt(const int& a = 0, const int& b = 0) { val = a, id = b;}
	const bool operator < (const pt& o) const { return val < o.val;}
}a[6][MAXN];
int T, n, m, siz, cnt, LB[MAXS], RB[MAXS], Belong[MAXN], Ans;
bitset<MAXN> MP[6][MAXS], Tem, Cur;
int main()
{
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d%*d", &n);
		siz = sqrt(n), cnt = (n-1)/siz+1;
		for (R int j = 1; j <= cnt; ++j)
		{
			LB[j] = RB[j-1] + 1;
			RB[j] = (j == cnt) ? n : (j * siz);
			for (R int k = LB[j]; k <= RB[j]; ++k) Belong[k] = j;
		}
		for (R int i = 1; i <= n; ++i)
		{
			for (R int j = 1; j <= 5; ++j)
			{
				scanf("%d", &a[j][i].val);
				a[j][i].id = i;
			}
		}
		for (R int i = 1; i <= 5; ++i)
		{
			sort(a[i] + 1, a[i] + 1 + n);
			for (R int j = 1; j <= cnt; ++j) MP[i][j] = 0;
		}
		for (R int i = 1; i <= 5; ++i)
		{
			for (R int j = 1; j <= cnt; ++j)
			{
				for (R int k = LB[j]; k <= RB[j]; ++k) MP[i][j][a[i][k].id] = 1;
				MP[i][j] |= MP[i][j-1];
			}
		}
		scanf("%d", &m);
		
		Ans = 0;
		R pt x(0, n + 1);
		R bool gg = 0;
		while (m--)
		{
			Tem.set();
			gg = 0;
			for (R int t, i = 1; i <= 5; ++i)
			{
				scanf("%d", &x.val);
				if(gg)continue;
				x.val ^= Ans;
				t = upper_bound(a[i] + 1, a[i] + 1 + n, x) - a[i] - 1;
				if (t < 1)
				{
					Tem.reset();
					gg = 1;
					continue;
				}
				Cur = MP[i][Belong[t]-1];
				for (R int j = LB[Belong[t]]; j <= t; ++j) Cur[a[i][j].id] = 1;
				Tem &= Cur;
			}
			Ans = Tem.count();
			printf("%d\n", Ans);
		}
	}
	return 0;
}