HDU 4027 Can you answer these queries? (Segment tree intervals are not updated), hdu4027

HDU 4027 Can you answer these queries? (Segment tree intervals are not updated), hdu4027

Enter n numbers. Then, if there are two types of operations, when 0 is input, all numbers in the given range are changed to the sum of all numbers in the given range.

Although it is an Interval Update, each vertex update is different. Therefore, only single points can be updated. In fact, a vertex can be updated up to 7 times. 2 ^ 64 After square 7 times, it becomes 1. If the number of a certain interval is if the range is changed to 1, you do not need to consider the start of this range. In addition, note that the given range may be reversed.

# Include <bits/stdc ++. h> # define lc p <1, s, mid # define rc p <1 | 1, mid + 1, e # define mid (s + e)> 1) using namespace std; typedef long LL; const int N = 100005; LL sum [N * 4]; void pushup (int p) {sum [p] = sum [p <1] + sum [p <1 | 1];} void build (int p, int s, int e) {if (s = e) {scanf ("% lld", & sum [p]); return;} build (lc); build (rc ); pushup (p);} void update (int p, int s, int e, int l, int r) {if (sum [p] = E-s + 1) return; // All numbers in the [e, s] range are 1 if (s = e) {sum [p] = sqrt (sum [p]); return;} if (l <= mid) update (lc, l, r); if (r> mid) update (rc, l, r); pushup (p);} LL query (int p, int s, int e, int l, int r) {if (s = l & e = r) return sum [p]; if (r <= mid) return query (lc, l, r ); if (l> mid) return query (rc, l, r); return query (lc, l, mid) + query (rc, mid + 1, r );} int main () {int n, m, a, B, c, k = 0; whil E (~ Scanf ("% d", & n) {printf ("Case # % d: \ n", ++ k); build (1, 1, n ); scanf ("% d", & m); while (m --) {scanf ("% d", & c, & a, & B ); if (B <a) swap (a, B); if (c) printf ("% lld \ n", query (1, 1, n, a, B )); else update (1, 1, n, a, B);} puts ("");} return 0 ;}

Can you answer these queries?
Problem DescriptionA lot of battleships of edevil are arranged in a line before the battle. our commander decides to use our secret weapon to eliminate the battleships. each of the battleships can be marked a value of endurance. for every attack of our secret weapon, it cocould 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 are asked to answer the queries that the sum of the endurance of a consecutive part of the battleship line.

Notice that the square root operation shocould be 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 are N battleships of edevil in a line. (1 <= N <= 100000)
The second line contains N integers Ei, indicating the endurance value of each battleship from the beginning of the line to the end. You can assume that the sum of all endurance value is 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 will decrease the endurance value of the battleships between the X-th and Y-th battleship, Volume Sive. the T = 1 denoting the query of the commander which ask for the sum of the endurance value of the battleship between X-th and Y-th, inclusive.
 
OutputFor each test case, print the case number at the first line. Then print one line for 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