十三届蓝桥杯大赛软件类省赛A组：选数异或

 

 

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int,int>pii;
const int mod = 1e9 + 7 , INF = 0x3f3f3f3f , N = 1e5 + 10;
 
 
// a[i] 表示 原数组
// vector<int> b[i]  值为b[i] 的 下标的集合
// c[i] 表示 下标等于a[i]，并且满足a[i]^b[j]==x最近的 下标j
 
int n,m,x;
int a[N];
vector<int> b[1 << 21];
int c[N];
 
struct Node
{
    int l,r;
    int v;
}tr[N * 4];
 
void push_up(int x)
{
    tr[x].v = min(tr[x << 1].v,tr[x << 1 | 1].v);
}
 
void build(int x,int l,int r)
{
    tr[x] = {l,r};
    if (l == r)
    {
        tr[x] = {l,r,c[l]};
        return;
    }
    int mid = l + r >> 1;
    build(x << 1,l,mid);
    build(x << 1 | 1,mid + 1,r);
    push_up(x);
}
 
int query(int x,int l,int r)
{
    if (tr[x].l >= l && tr[x].r <= r)
        return tr[x].v;
    int mid = tr[x].l + tr[x].r >> 1;
     
    int res = INF;
    if (l <= mid)
        res = query(x << 1,l,r);
    if (r > mid)
        res = min(res,query(x << 1 | 1,l,r));
    return res;
}

int getId(int t,int i)
{
    return lower_bound(b[t].begin(),b[t].end(),i) - b[t].begin();
}
int main()
{
    scanf("%d%d%d",&n,&m,&x);
    for (int i = 1 ; i <= n ; i ++)
    {
        scanf("%d",&a[i]);
        b[a[i]].push_back(i);
    }
    //c下标初始为INF
    memset(c,0x3f,sizeof c);
    for (int i = 1 ; i <= n ; i ++)
    {
        int t = a[i] ^ x;
        if (b[t].size() == 0)
            continue;
        int pos = b[t][getId(t,i)];
        if (pos >= i)
            c[i] = pos;
    }
    // 建立下标线段树： 找到区间最的最大值
     
    build(1,1,n);
    
    while (m --)
    {
        int l,r;
        scanf("%d%d",&l,&r);
        if (query(1,l,r) <= r)
            printf("yes\n");
        else
            printf("no\n");
    }
}