【HDU】2021杭电暑假集训营（第一场):Xor sum 字典树

最新推荐文章于 2024-10-12 22:21:30 发布

匿枫

最新推荐文章于 2024-10-12 22:21:30 发布

阅读量118

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/tlyzxc/article/details/119360934

版权

传送门

题意

给你一个序列，需要你求一个最短的子序列保证异或和大于等于 $k$

分析

首先我们可以把这个序列的疑惑前缀和搞出来，因为 $l, r$ 这个区间的异或和等于 $sum[r] ^ sum[l - 1]$
我们每次枚举右端点，然后在字典树中按位查找，查找玩之后把当前这一位插入字典树即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 5e6 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int tr[N][2];
int idx;
int w[N];
int ed[N];
int a[N];
int n, m;

void insert(int x, int l) {
	int p = 0;
	for (int i = 30; ~i; i--) {
		int op = x >> i & 1;
		if (!tr[p][op]) tr[p][op] = ++idx;
		p = tr[p][op];
		w[p] = max(w[p], l);
	}
	ed[p] = 1;
}

int query(int x, int k) {
	int res = -1;
	int p = 0;
	for (int i = 30; ~i; i--) {
		int op = x >> i & 1;
		if (!(k >> i & 1)) {
			if (tr[p][!op]) res = max(res, w[tr[p][!op]]);
			if (tr[p][op]) p = tr[p][op];
			else break;
		}
		else {
			if (tr[p][!op]) p = tr[p][!op];
			else break;
		}
		if (!p) break;
	}
	if (ed[p]) res = max(res, w[p]);
	return res;
}

int main() {
	int T;
	read(T);
	while (T--) {
		read(n), read(m);
		for (int i = 0; i <= idx + 500; i++) ed[i] = 0, w[i] = 0, tr[i][0] = tr[i][1] = 0;
		idx = 0;
		int sum = 0;
		int l = 0, r = INF;
		for (int i = 1; i <= n; i++) {
			int x;
			read(x);
			sum ^= x;
			int p = query(sum, m);
			if (p != -1 && i - p < r - l + 1) l = p + 1, r = i;
			insert(sum, i);
		}
		if (r == INF) puts("-1");
		else printf("%d %d\n", l, r);
	}
	return 0;
}