CF617E XOR and Favorite Number

思路

代码

#include 
#include 
#include 
#include 
#define int long long
using namespace std;
int n,m,k,a[100100],belong[100100],sz,num,L,R,ans[100100],barrel[2001000],sum=0;
struct Query{
    int l,r,id;
    bool operator < (const Query &b){
        return (belong[l]==belong[b.l])?rQ[i].l)
            moveL(-1);
        while(RQ[i].r)
            moveR(-1);
        ans[Q[i].id]=sum;
    }
    for(int i=1;i<=m;i++)
        printf("%lld\n",ans[i]);
    return 0;
}