F. Ivan and Burgers(前缀线性基模板)

前缀线性基模板

F. Ivan and Burgers

/*Author : lifehappy
*/
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>#define mp make_pair
#define pb push_back
#define endl '\n'
#define mid (l + r >> 1)
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define ls rt << 1
#define rs rt << 1 | 1using namespace std;typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;const double pi = acos(-1.0);
const double eps = 1e-7;
const int inf = 0x3f3f3f3f;inline ll read() {ll f = 1, x = 0;char c = getchar();while(c < '0' || c > '9') {if(c == '-')    f = -1;c = getchar();}while(c >= '0' && c <= '9') {x = (x << 1) + (x << 3) + (c ^ 48);c = getchar();}return f * x;
}const int N = 5e5 + 10;struct PrefixLinearBasis {int base[N][64], pos[N][64], num, n = 30;void init() {for(int i = 0; i < N; i++) {memset(base[i], 0, sizeof base[i]);memset(pos[i], 0, sizeof pos[i]);num = 0;}}void add(int x) {num++;for(int i = 0; i <= n; i++) {base[num][i] = base[num - 1][i];pos[num][i] = pos[num - 1][i];}int p = num;for(int i = n; ~i; i--) {if(x >> i & 1) {if(base[num][i] == 0) {base[num][i] = x;pos[num][i] = p;return ;}if(pos[num][i] < p) {swap(pos[num][i], p);swap(base[num][i], x);}x ^= base[num][i];}}}int query_max(int l, int r) {ll ans = 0;for(int i = n; ~i; i--) {if(pos[r][i] < l) continue;if((ans ^ base[r][i]) > ans) {ans ^= base[r][i];}}return ans;}int query_min(int l, int r) {for(int i = 0; i <= n; i++) {if(pos[r][i] < l) continue;if(base[r][i]) return base[r][i];}}
}ans;int main() {// freopen("in.txt", "r", stdin);// freopen("out.txt", "w", stdout);// ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);int n = read();for(int i = 1; i <= n; i++) {ll x = read();ans.add(x);}int m = read();for(int i = 1; i <= m; i++) {int l = read(), r = read();printf("%d\n", ans.query_max(l, r));}return 0;
}

F. Ivan and Burgers(前缀线性基模板)相关推荐

HDU 6579 Operation (前缀线性基模板题)
Operation 思路只要套上前缀线性基的板子然后按照题意模拟即可,前缀线性基模板题了. 代码 /*Author : lifehappy */ #pragma GCC optimize(2) #p ...
【Codeforces Round #532 (Div. 2) F. Ivan and Burgers】离线+线性基
F. Ivan and Burgers 题意 n个数,q次询问,每次询问一个区间内选出任意个数的异或最大值. 1<=n<=5∗1051<=n<=5*10^51<=n< ...
Codeforces 1100 F - Ivan and Burgers
F - Ivan and Burgers 思路:线性基+贪心,保存线性基中每一位的最后一个代码: #pragma GCC optimize(2) #pragma GCC optimize(3) #p ...
Codeforces Round #532 (Div. 2) F. Ivan and Burgers(可持久化异或线性基+双指针)
题意给n个数,q组询问,每次询问l到r的最大异或和思路来源某cf奆神代码题解本来应该是线性基上分治的这里一发基数+贪心也能过真是神仙代码啊双指针的经典应用: 对于每个询问[l,r],r ...
CF1100F Ivan and Burgers（线性基）
解析做幸运数字的时候逛题解区爬过来的挺妙的把所有询问离线下来,按右端点排序贪心的让最高位更高的向量出现的尽可能向右实现上可以把线性基里的向量和当前的数swap来实现代码就非常好写了代码 ...
线性基+前缀线性基学习笔记
学习于这个博客首先,线性基是一个集合,对于任何一个序列一定有至少一个线性基,取线性基中的某些数异或起来一定可以得到原序列中的任何一个数. 线性基三大性质: 1.原序列中的任何一个数都可以由线性基里面 ...
【CF1100F】 Ivan and Burgers （分治+线性基）
description 戳我看题目(づ￣3￣)づ╭❤- solution 异或和最大 --关联线性基线性基: 原序列的每一个数都能由线性基里若干个数异或得到线性基里若干个数的异或结果不可能为0 如 ...
CF1100F Ivan and Burgers
CF1100F Ivan and Burgers 静态区间,选取任意个数使得它们的异或和最大 \(n,\ m\leq5\times10^5,\ a_i\in[0,\ 10^6]\) lxl ST表,线 ...
Ivan and Burgers（CF-1100F）
Problem Description Ivan loves burgers and spending money. There are nn burger joints on the street ...

F. Ivan and Burgers(前缀线性基模板)

前缀线性基模板

F. Ivan and Burgers

F. Ivan and Burgers(前缀线性基模板)相关推荐

最新文章

热门文章