bzoj3110: [Zjoi2013]K大数查询 【树套树，标记永久化】

type
  arr=record
    all,mark:longint;
  end;
const
  maxn=10000000;
var
  tree:array[0..maxn]of arr;
  size,lson,rson,root1,root2:array[0..maxn]of longint;
  tot,sum,n,m,i,j,k,l:longint;
 
function add:longint;
begin
  inc(tot);
  exit(tot);
end;
 
procedure sinsert(var x:longint;y,z:longint);
var
  left,right,mid,old:longint;
begin
  if x=0 then x:=add;
  old:=x;
  left:=1;
  right:=n;
  while left<=right do begin
    mid:=(left+right)>>1;
    inc(size[x],z);
    if left=right then break;
    if y<=mid then begin
      right:=mid;
      if lson[x]=0 then lson[x]:=add;
      x:=lson[x];
    end
    else begin
      left:=mid+1;
      if rson[x]=0 then rson[x]:=add;
      x:=rson[x];
    end;
  end;
  x:=old;
end;
 
procedure binsert(x,l,r,tl,tr,tc:longint);
var
  mid:longint;
begin
  if (tl=l) and (tr=r) then begin
    sinsert(tree[x].mark,tc,1);
    exit;
  end;
  mid:=(l+r)>>1;
  sinsert(tree[x].all,tc,tr-tl+1);
  if tl>mid then binsert(x<<1+1,mid+1,r,tl,tr,tc)
  else
    if tr<=mid then binsert(x<<1,l,mid,tl,tr,tc)
    else begin
      binsert(x<<1,l,mid,tl,mid,tc);
      binsert(x<<1+1,mid+1,r,mid+1,tr,tc);
    end;
end;
 
procedure before(x,l,r,tl,tr:longint);
var
  mid:longint;
begin
  inc(sum);
  root1[sum]:=tree[x].mark;
  root2[sum]:=tr-tl+1;
  if (tl=l) and (tr=r) then begin
    inc(sum);
    root1[sum]:=tree[x].all;
    root2[sum]:=1;
    exit;
  end;
  mid:=(l+r)>>1;
  if tl>mid then before(x<<1+1,mid+1,r,tl,tr)
  else
    if tr<=mid then before(x<<1,l,mid,tl,tr)
    else begin
      before(x<<1,l,mid,tl,mid);
      before(x<<1+1,mid+1,r,mid+1,tr);
    end;
end;
 
procedure query(x,y,z:longint);
var
  left,right,now,mid:longint;
begin
  sum:=0;
  before(1,1,n,x,y);
  left:=1;
  right:=n;
  while left<right do begin
    now:=0;
    mid:=(left+right)>>1;
    for i:=1 to sum do
      now:=size[rson[root1[i]]]*root2[i]+now;
    if now<z then begin
      dec(z,now);
      right:=mid;
      for i:=1 to sum do
        root1[i]:=lson[root1[i]];
    end
    else begin
      left:=mid+1;
      for i:=1 to sum do
        root1[i]:=rson[root1[i]];
    end;
  end;
  writeln(left);
end;
 
begin
  readln(n,m);
  while m>0 do begin
    dec(m);
    readln(i,j,k,l);
    if i=1 then binsert(1,1,n,j,k,l)
      else query(j,k,l);
  end;
  readln;
  readln;
end.