BZOJ3211: 花神游历各国

3211: 花神游历各国

Time Limit: 5 Sec  Memory Limit: 128 MB
Submit: 817  Solved: 295
[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 数据已加强

题解：

花神游历各国=上帝造题的七分钟2

尼玛拿着原来的pascal就是A不了，无了奈了。。。

代码：

1.pascal

var i,n,x,y,k,t,temp,m:longint;
    s,fa,a:array[0..200100] of int64;
function find(x:longint):longint;
 begin
 if fa[x]<>x then fa[x]:=find(fa[x]);
 exit(fa[x]);
 end;
function lowbit(x:longint):longint;
 begin
 exit(x and (-x));
 end;
procedure add(x,y:int64);
 begin
 while x<=n do
  begin
  inc(s[x],y);
  inc(x,lowbit(x));
  end;
 end;
function sum(x:int64):int64;
 begin
 sum:=0;
 while x>0 do
  begin
  inc(sum,s[x]);
  dec(x,lowbit(x));
  end;
 exit(sum);
 end;
procedure update(x,y:longint);
 var i:longint;
 begin
 i:=find(x);
 while i<=y do
  begin
  temp:=trunc(sqrt(a[i]));
  add(i,temp-a[i]);
  a[i]:=temp;
  if a[i]=1 then fa[i]:=i+1;
  i:=find(i+1);
  end;
 end;
procedure init;
 begin
 readln(n);
 for i:=1 to n do begin read(a[i]);fa[i]:=i;add(i,a[i]);end;
 fa[n+1]:=n+1;
 end;
procedure main;
 begin
 readln(m);
 for i:=1 to m do
  begin
  readln(k,x,y);
  if x>y then begin t:=x;x:=y;y:=t;end;
  case k of
  2:update(x,y);
  1:writeln(sum(y)-sum(x-1));
  end;
  end;
 end;
begin
 init;
 main;
end.

pascal各种T，c++写了一遍就A了。。。 

2.c++ 

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<queue>
#define inf 1000000000
#define maxn 100000+100
#define maxm 500+100
#define eps 1e-10
#define ll long long
#define pa pair<int,int>
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
    return x*f;
}
ll s[maxn];
int n,m,fa[maxn],a[maxn];
void add(int x,int y)
{
    for(;x<=n;x+=x&(-x))s[x]+=y;
}
ll sum(int x)
{
    ll t=0;
    for(;x>0;x-=x&(-x))t+=s[x];
    return t;
}
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    n=read();
    for(int i=1;i<=n;i++){a[i]=read();add(i,a[i]);fa[i]=i;}
    fa[n+1]=n+1;
    m=read();
    while(m--)
    {
        int ch=read(),l=read(),r=read();//cout<<ch<<' '<<l<<' '<<r<<endl;
        if(ch==1)printf("%lld
",sum(r)-sum(l-1));
        else 
        {
            for(int i=find(l);i<=r;i=find(i+1))
             {
              int t=int(sqrt(a[i]));
              add(i,t-a[i]);
              a[i]=t;
              if(a[i]<=1)fa[i]=find(i+1);
             } 
        }
    }
    return 0;
}

树状数组+并查集冲进第一版