【开源社区openEuler实践】The 14th Jilin Provincial Collegiate Programming Contest

原创

已于 2025-01-02 15:04:14 修改 · 295 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

于 2024-10-04 02:27:49 首次发布

题目

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
#define ll long long
#define pii pair<int, int>
#define ld long double
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5, base = 37;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
// const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;
int n, m;

int t[maxn];//树状数组维护区间 所有 不同数字 的异或和
int lowbit(int x){
	return x & -x;
}

void add(int x, int k){
	for(int i = x; i <= n; i += lowbit(i)){
		t[i] ^= k;
	}
}
int ask(int x){
	int res = 0;
	for