hdoj 4027 Can you answer these queries?(线段树+灵活的区间更新)

Can you answer these queries?

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 19302    Accepted Submission(s): 4555

Problem Description

A lot of battleships of evil 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 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 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 should be rounded down to integer.

 

Input

The 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 evil 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 2 ⁶³.
  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, inclusive. 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.

 

Output

For 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

  
  

   
   10
1 2 3 4 5 6 7 8 9 10
5
0 1 10
1 1 10
1 1 5
0 5 8
1 4 8
  
  

 

Sample Output

  
  

   
   Case #1:
19
7
6
  
  

 

Source

The 36th ACM/ICPC Asia Regional Shanghai Site —— Online Contest

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   3308  1166  2871  1542  3397 

更新：将原来的值变成原来值的开根号。

如果变成值变为1之后，就不用更新了。

sum[rt]==R-L+1时，整个区间的所有的值都是1，就不用更新了。

#include <cstdio>
#include <algorithm>
#include<cmath>
using namespace std;


#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define LL long long
const int maxn = 100010;
LL sum[maxn << 2];
void PushUp(int rt) {
	sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void build(int l, int r, int rt) {
	
	if (l == r) {
		scanf("%lld", &sum[rt]);
		return;
	}
	int m = (l + r) >> 1;
	build(lson);
	build(rson);
	PushUp(rt);
}
void update(int L, int R, int l, int r, int rt) {


	if (sum[rt] == r - l + 1)return;//坑点二
	if (l==r) {
		sum[rt] = (LL(sqrt(sum[rt])));//坑点三
		return;
	}


	int m = (l + r) >> 1;
	if (L <= m) update(L, R,  lson);
	if (m < R) update(L, R,  rson);
	PushUp(rt);
}
LL query(int L, int R, int l, int r, int rt) {
	if (L <= l && r <= R) {
		return sum[rt];
	}
	int m = (l + r) >> 1;
	LL ret = 0;
	if (L <= m) ret += query(L, R, lson);
	if (m < R) ret += query(L, R, rson);
	return ret;
}
int main()
{
	int n,cas=0;
	while (scanf("%d",&n)!=EOF)
	{
		printf("Case #%d:\n", ++cas);
		build(1, n, 1);
		int m;
		scanf("%d", &m);


		while (m--)
		{
			int t, x, y;
			scanf("%d%d%d", &t, &x,&y);
			if (x > y)swap(x, y);//坑点1
			if (t == 0)
			{
				update(x, y, 1, n, 1);
			}
			else
			{
				printf("%lld\n", query(x, y, 1, n, 1));
			}
		}
		puts("");
	}
	
	return 0;
}