Hdu 4027 Can You answer these queries? (Line segment tree)

Can you answer these queries?Time limit:4000/2000 MS (java/others) Memory limit:65768/65768 K (java/others)
Total submission (s): 9185 Accepted Submission (s): 2100


Problem Descriptiona lot of battleships of evil is arranged in a line before the battle. Our commander decides-to-use we secret weapon to eliminate the battleships. Each of the battleships can is marked a value of endurance. For every attack of We secret weapon, it could decrease the endurance of a consecutive part of battleships by make their Endurance to the square root of it original value of endurance. During the series of Attack of our secret weapon, the commander wants to evaluate the effect of the weapon, so he asks you For help.
You is asked to answer the queries, the sum of the endurance of a consecutive part of the battleship line.

Notice that square root operation should is rounded down to integer.
Inputthe input contains several test cases, terminated by EOF.
For each test case, the first line contains a single integer n, denoting there is n battleships of evil in a line. (1 <= N <= 100000)
The second line contains N integers Ei, indicating the endurance value of all battleship from the beginning of the line T o the end. You can assume, the sum of all endurance value are less than 263.
The next line contains an integer M, denoting the number of actions and queries. (1 <= M <= 100000)
For the following M lines, each line contains three integers T, X and Y. The t=0 denoting the action of the secret weapon, which would decrease the endurance value of the battleships between the X -th and y-th battleship, inclusive. The t=1 denoting the commander which ask for the sum of the endurance value of the battleship between a D y-th, inclusive.

Outputfor each test case, print the case number at the first line. Then print one to each query. And remember follow a blank line after each test case.
Sample Input

101 2 3 4 5 6 7 8 9 1050 1 101 1 101 1 50 5 81 4 8

Sample Output

Case #1:1976

Sourcethe 36th ACM/ICPC Asia Regional Shanghai Site--online Contest
Recommendlcy | We have carefully selected several similar problems for you:3308 2871 1542 4046 4028

Test instructions: 0 x y: interval [x, y] All numbers are updated to the original root, 1 x y: the and of [X, y] all numbers.
The puzzle: Update to 1 before the violence update. All digits of the interval 1, without updating.

#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <string > #include <algorithm> #include <cstdlib> #include <set> #include <queue> #include <stack > #include <vector> #include <map> #define N 100010#define Mod 10000007#define Lson l,mid,idx<<1#  Define Rson mid+1,r,idx<<1|1#define LC idx<<1#define RC Idx<<1|1const Double EPS = 1e-11;const double PI = ACOs ( -1.0); const double E = 2.718281828;typedef long long ll;const int INF = 1000010;using namespace std;struct node    {__int64 sum;    int OP;//1: Interval is all 1 0: not all 1} tree[n<<2];int n,m;void push_up (int idx) {tree[idx].sum=tree[lc].sum+tree[rc].sum; Tree[idx].op= (tree[lc].op==1&&tree[rc].op==1);}    void build (int l,int r,int idx) {tree[idx].op=0;        if (l==r) {scanf ("%i64d", &tree[idx].sum);    Return    } int mid= (L+R) >>1;    Build (Lson);    Build (Rson); PUSH_UP (idx);} void Update (int l,int r, int idx,int X,int y) {if (tree[idx].op==1) return;        if (l==r) {tree[idx].sum=sqrt (double (tree[idx].sum));        if (tree[idx].sum==1) tree[idx].op=1;    Return    } int mid= (L+R) >>1;    if (x<=mid) update (LSON,X,Y);    if (y>mid) update (RSON,X,Y); PUSH_UP (idx);}    __int64 query (int l,int r,int idx,int x,int y) {if (x<=l&&r<=y) return tree[idx].sum;    __int64 ans=0;    int mid= (L+R) >>1;    if (x<=mid) ans+=query (lson,x,y);    if (y>mid) ans+=query (rson,x,y); return ans;}    int main () {//freopen ("In.txt", "R", stdin);    int ca=1;        while (~SCANF ("%d", &n)) {build (1,n,1);        scanf ("%d", &m);        printf ("Case #%d:\n", ca++);        int x,y,op;            while (m--) {scanf ("%d%d%d", &op,&x,&y);            if (x>y) swap (x, y);            if (OP) printf ("%i64d\n", Query (1,n,1,x,y));     Else           Update (1,N,1,X,Y);    } printf ("\ n"); } return 0;}

Hdu 4027 Can You answer these queries? (Line segment tree)