2019中国大学生程序设计竞赛（CCPC） - 网络选拔赛 array

 http://acm.hdu.edu.cn/showproblem.php?pid=6703

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e5+9;

int tree[maxn<<2];
int a[maxn],pos[maxn];
int n,m;

void pushup(int rt)
{
    tree[rt]=max(tree[lson],tree[rson]);
}

void build(int l,int r,int rt)
{
    if(l==r)
    {
        tree[rt]=pos[l];
        return ;
    }
    int mid=(l+r)>>1;
    build(l,mid,lson);
    build(mid+1,r,rson);
    pushup(rt);
}

void update(int id,int val,int l,int r,int rt)
{
    if(l==r)
    {
        tree[rt]=val;
        return ;
    }
    int mid=(l+r)>>1;
    if(id<=mid) update(id,val,l,mid,lson);
    else update(id,val,mid+1,r,rson);
    pushup(rt);
}

int query(int k,int qr,int l,int r,int rt)
{
    if(r<k) return n+1;

    if(tree[rt]<=qr) return n+1;

    if(l==r) return l;

    int mid=(l+r)>>1;

    int tmp1=n+1;
    tmp1=query(k,qr,l,mid,lson);
    if(tmp1==n+1) tmp1=query(k,qr,mid+1,r,rson);
    return tmp1;

    //return min(query(k,qr,l,mid,lson),query(k,qr,mid+1,r,rson));


}

int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);

    int T;
    cin>>T;
    while(T--)
    {
        cin>>n>>m;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            pos[a[i]]=i;
        }
        pos[n+1]=n+1;
        int lastans=0;
        build(1,n+1,1);
        while(m--)
        {
            int op;
            int t1,t2,t3;
            cin>>op;
            if(op==1)
            {
                cin>>t1;
                int id=t1^lastans;
                update(a[id],n+1,1,n+1,1);
            }
            else
            {
                cin>>t2>>t3;
                int r=t2^lastans;
                int k=t3^lastans;
                lastans=query(k,r,1,n+1,1);
                cout<<lastans<<endl;
            }
        }
    }



    return 0;
}