HDU4893--Wow! Such Sequence! （线段树 延迟标记）

Wow! Such Sequence!

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 3354    Accepted Submission(s): 966

Problem Description

Recently, Doge got a funny birthday present from his new friend, Protein Tiger from St. Beeze College. No, not cactuses. It's a mysterious blackbox.

After some research, Doge found that the box is maintaining a sequence an of n numbers internally, initially all numbers are zero, and there are THREE "operations":

1.Add d to the k-th number of the sequence.
2.Query the sum of ai where l ≤ i ≤ r.
3.Change ai to the nearest Fibonacci number, where l ≤ i ≤ r.
4.Play sound "Chee-rio!", a bit useless.

Let F₀ = 1,F₁ = 1,Fibonacci number Fn is defined as F_n = F_{n - 1} + F_{n - 2} for n ≥ 2.

Nearest Fibonacci number of number x means the smallest Fn where |F_n - x| is also smallest.

Doge doesn't believe the machine could respond each request in less than 10ms. Help Doge figure out the reason.

 

Input

Input contains several test cases, please process till EOF.
For each test case, there will be one line containing two integers n, m.
Next m lines, each line indicates a query:

1 k d - "add"
2 l r - "query sum"
3 l r - "change to nearest Fibonacci"

1 ≤ n ≤ 100000, 1 ≤ m ≤ 100000, |d| < 2³¹, all queries will be valid.

 

Output

For each Type 2 ("query sum") operation, output one line containing an integer represent the answer of this query.

 

Sample Input

1 1

2 1 1

5 4

1 1 7

1 3 17

3 2 4

2 1 5

 

Sample Output

0

22

 

Author

Fudan University

 

Source

2014 Multi-University Training Contest 3

 

题意：

1.Add d to the k-th number of the sequence.
2.Query the sum of ai where l ≤ i ≤ r.
3.Change ai to the nearest Fibonacci number, where l ≤ i ≤ r.     就这三句话

 #include <cmath>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 typedef long long ll;
 const int maxn = 1e5 + ;
 ll fab[];
 int lazy[maxn<<];                   //lazy[pos]为1 表示该区间的数为Fibonacci number。
 ll sum1[maxn<<],sum2[maxn<<];      // sum1为原数组的和，sum2为变为Fibonacci number之后的和，维护这两个数组
 void pre_solve()                     //预处理数前90个斐波那契数
 {
     fab[] = fab[] = ;
     for (int i = ; i <= ; i++)
         fab[i] = fab[i-] + fab[i-];
 }
 ll find_fab(ll x)                          //找到距离x最近的斐波那契数
 {
     ll ans = fab[],delta= abs(fab[] - x);
     for (int i = ; i <= ; i++)
     {
         if (delta > abs(x - fab[i]))
         {
             delta = abs (x - fab[i]);
             ans = fab[i];
         }
     }
     return ans;
 }
 void push_down(int pos)
 {
     if (lazy[pos])
     {
         lazy[pos<<] = lazy[pos<<|] = lazy[pos];
         lazy[pos] = ;
         sum1[pos<<] = sum2[pos<<];
         sum1[pos<<|] = sum2[pos<<|];
     }
 }
 void push_up(int pos)
 {
     sum1[pos] = sum1[pos<<] + sum1[pos<<|];
     sum2[pos] = sum2[pos<<] + sum2[pos<<|];
 }
 void build(int l,int r,int pos)
 {
     sum1[pos] = lazy[pos] = ;
     if (l == r)
     {
         sum2[pos] = ;                          //初始状态 所有数都为0，距离0最近的斐波那契数是1
         return;
     }
     int mid = (l + r) >> ;
     build(l,mid,pos<<);
     build(mid+,r,pos<<|);
     push_up(pos);
 }
 void update_add(int l,int r,int pos,int x,int val)
 {
     if (l == r)
     {
         if (lazy[pos])
             sum1[pos] = sum2[pos] + val;            //如果该位置的数字为斐波那契数，那么在此基础上加val
         else
             sum1[pos] += val;                      //不是斐波那契数 直接加val
         sum2[pos] = find_fab(sum1[pos]);            //sum1[pos] 改变，相应的sum2也要改变
         lazy[pos] = ;
         return;
     }
     push_down(pos);
     int mid = (l + r) >> ;
     if (x <= mid)
         update_add(l,mid,pos<<,x,val);
     else
         update_add(mid+,r,pos<<|,x,val);
     push_up(pos);
 }
 void update_fab(int l,int r,int pos,int ua,int ub)
 {
     if (ua <= l && ub >= r)
     {
         sum1[pos] = sum2[pos];
         lazy[pos] = ;
         return;
     }
     push_down(pos);
     int mid = (l + r) >> ;
     if (ua <= mid)
         update_fab(l,mid,pos<<,ua,ub);
     if (ub > mid)
         update_fab(mid+,r,pos<<|,ua,ub);
     push_up(pos);
 }
 ll query(int l,int r,int pos,int ua,int ub)
 {
     if (ua <= l && ub >= r )
         return sum1[pos];
     push_down(pos);
     int mid = (l + r) >> ;
     ll ans = ;
     if (ua <= mid)
         ans += query(l,mid,pos<<,ua,ub);
     if (ub > mid)
         ans += query(mid+,r,pos<<|,ua,ub);
     return ans;
 }
 int main(void)
 {
     #ifndef ONLINE_JUDGE
         freopen("in.txt","r",stdin);
         freopen("out.txt","w",stdout);
     #endif
     pre_solve();
     int n,m;
     while (~scanf ("%d%d",&n,&m))
     {
         build(,n,);
         for (int i = ; i < m; i++)
         {
             int op,x,y;
             scanf ("%d%d%d",&op,&x,&y);
             if (op == )
                 update_add(,n,,x,y);
             if (op == )
                 update_fab(,n,,x,y);
             if (op == )
                 printf("%I64d\n",query(,n,,x,y));
         }
     }
     return ;
 }