【Codeforces 292 E. Copying Data】线段映射

Cf 292 E
题目大意：给你a，b两个数组，两个操作，一个是把a里连续的一段复制到b中，另一个是单点查询b。

解：可以看到其实a是不修改的，本质我们要维护b到a的一个映射，而赋值又是连续的，所以本质又是维护公差1的等差序列，那么这个等差序列只要一个首项就能表达他自己的性质。所以我们每个线段存一个首项，lazytag维护即可。

这题算是开了自己一个位移运算的先河吧
感谢lls！

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 100025;
int n,m,a[MAX_N],b[MAX_N];
namespace sgt
{
    #define lc (rt<<1)
    #define rc (rt<<1|1)
    #define mid ((l+r)>>1)
    int pos[MAX_N<<2],col[MAX_N<<2];
    void pushnow(int rt,int v){col[rt] = pos[rt] = v;}
    void down(int rt,int l,int r) {if(col[rt]){pushnow(lc,col[rt]),pushnow(rc,col[rt]+mid-l+1),col[rt] = 0;}}
    void update(int rt,int l,int r,int x,int y,int v){
        if(x<=l&&r<=y)  return pushnow(rt,v+l-x);
        down(rt,l,r);
        if(x>mid) update(rt<<1|1,mid+1,r,x,y,v);
        else if(y<=mid) update(rt<<1,l,mid,x,y,v);
        else update(rt<<1,l,mid,x,y,v),update(rt<<1|1,mid+1,r,x,y,v);
    }
    int query(int rt,int l,int r,int x){
        if(l==r)    return pos[rt]?a[pos[rt]]:b[l];
        down(rt,l,r);
        if(x<=mid) return query(rt<<1,l,mid,x);
        else return query(rt<<1|1,mid+1,r,x);
    }
    #undef lc
    #undef rc
    #undef mid
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int opt,x,y,k;
    scanf("%d%d",&n,&m);
    for(int i = 1;i<=n;++i) scanf("%d",&a[i]);
    for(int i = 1;i<=n;++i) scanf("%d",&b[i]);
    while(m--)
    {
        scanf("%d%d",&opt,&x);
        if(opt==1)
        {
            scanf("%d%d",&y,&k);
            sgt::update(1,1,n,y,y+k-1,x);
        }
        else
        {
            printf("%d\n",sgt::query(1,1,n,x));
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}