3211: 花神游历各国

3211: 花神游历各国

Time Limit: 5 Sec  Memory Limit: 128 MB
Submit: 1042  Solved: 381
[Submit][Status]

Description

 

Input

 

Output

每次x=1时，每行一个整数，表示这次旅行的开心度

 

Sample Input

4

1 100 5 5

5

1 1 2

2 1 2

1 1 2

2 2 3

1 1 4

Sample Output

101

11

11

HINT

 

对于100%的数据， n ≤ 100000，m≤200000 ,data[i]非负且小于10^9

 

 

Source

SPOJ2713 gss4 数据已加强

 

题解：嗯哼！！！果然是加强版的数据，可惜还是一遍AC了（HansBug：^_^，咦？最近phile呢？），其实和“上帝造题的7分钟2”基本上一样，就是它的强化版，重点在于处理优化掉一些不必要的操作即可（比如当某区间内的数字全部<=1呵呵呵），具体不再赘述，详见我的代码模板：线段树5（传送门在此）

 

var
   i,j,k,l,m,n:longint;
   a,b:array[0..1000000] of int64;
function max(x,y:longint):longint;inline;
         begin
              if x>y then max:=x else max:=y;
         end;
function min(x,y:longint):longint;inline;
         begin
              if x<y then min:=x else min:=y;
         end;

procedure built(z,x,y:longint);inline;
          begin
               if (x=y) then
                  begin
                       read(a[z]);
                       if a[z]<=1 then b[z]:=1 else b[z]:=0;
                  end
               else
                   begin
                        built(z*2,x,(x+y) div 2);
                        built(z*2+1,(x+y) div 2+1,y);
                        a[z]:=a[z*2]+a[z*2+1];
                        if (b[z*2]=1) and (b[z*2+1]=1) then b[z]:=1 else b[z]:=0;
                   end;
          end;
function op(z,x,y,l,r:longint):int64;inline;
         var a2,a3:int64;
         begin
              if l>r then exit(0);
              if b[z]=1 then exit(0);
              if (x=l) and (y=r) and (l=r) then
                 begin
                      a2:=a[z];
                      a[z]:=trunc(sqrt(a[z]));
                      if a[z]<=1 then b[z]:=1;
                      exit(a[z]-a2);
                 end;
              a2:=op(z*2,x,(x+y) div 2,l,min(r,(x+y) div 2));
              a3:=op(z*2+1,(x+y) div 2+1,y,max((x+y) div 2+1,l),r);
              a[z]:=a[z]+a2+a3;
              if (b[z*2]=1) AND (b[z*2+1]=1) then b[z]:=1;
              exit(a2+a3);
         end;
function cal(z,x,y,l,r:longint):int64;inline;
         var a2,a3:int64;
         begin
              if l>r then exit(0);
              if (x=l) and (y=r) then exit(a[z]);
              a2:=cal(z*2,x,(x+y) div 2,l,min(r,(x+y) div 2));
              a3:=cal(z*2+1,(x+y) div 2+1,y,max((x+y) div 2+1,l),r);
              exit(a2+a3);
         end;
begin
     readln(n);
     built(1,1,n);
     readln;
     readln(m);
     for i:=1 to m do
         begin
              readln(j,k,l);
              case j of
                   1:writeln(cal(1,1,n,k,l));
                   2:op(1,1,n,k,l);
              end;
         end;
     readln;
end.