卓见杯”2020年河南省第二届CCPC 二进制与、平方和（线段树，二进制

 

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<string>
#include<cstring>
#include<bitset> 
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<iomanip>
#include<algorithm>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define PI  acos(-1)
using namespace std;

const int INF = 0x3f3f3f3f;
const int maxn = 3e5+5;
const int mod = 998244353;
int n,m,k;
int a[maxn];

struct node{
	int l,r,sum;
	int cnt[25];
}tr[maxn * 4];

void pushup(int u){
	tr[u