HDU
来源:互联网 发布:森女部落淘宝官网 编辑:程序博客网 时间:2024/05/29 19:01
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4027点击打开链接
Can you answer these queries?
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 18426 Accepted Submission(s): 4344
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.
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 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, 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.
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 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, 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
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
区间更新区间查询操作
poj的g++用longlong c++用__int64
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;#define maxn 1000000+5struct xjy{ int lazy; int left; int right; __int64 sum;};xjy tree[maxn<<2];__int64 a[maxn];__int64 aans;void show(int i,int left,int right){ if(left==right) { printf("%I64d %I64d %I64d\n",tree[i].left,tree[i].right,tree[i].sum); return ; } int mid=(left+right)>>1; show(i<<1,left,mid); show(i<<1|1,mid+1,right); printf("%I64d %I64d %I64d\n",tree[i].left,tree[i].right,tree[i].sum);}void build(int i,int left ,int right){ if(left==right) { tree[i].left=left; tree[i].right=right; tree[i].sum=a[left]; tree[i].lazy=1; if(a[left]<=1) tree[i].lazy=0; return ; } int mid=(left+right)>>1; build(i<<1,left,mid); build (i<<1|1,mid+1,right); tree[i].sum=tree[i<<1].sum+tree[i<<1|1].sum; tree[i].left=left; tree[i].right=right;}void updateregion(int i,int left,int right){ if(!tree[i].lazy) { return; } if(tree[i].left==left&&tree[i].right==right&&tree[i].left==tree[i].right) { tree[i].sum=(__int64)sqrt(1.0*tree[i].sum); if(tree[i].sum==1) tree[i].lazy=0; return; } int mid=(tree[i].left+tree[i].right)>>1; if(right<=mid) updateregion(i<<1,left,right); else if(left>mid) updateregion(i<<1|1,left,right); else { updateregion(i<<1,left,mid); updateregion(i<<1|1,mid+1,right); } tree[i].sum=tree[i<<1].sum+tree[i<<1|1].sum; if(tree[i].sum==(tree[i].right-tree[i].left+1)) tree[i].lazy=0;}void queryregion(int i,int left,int right){ if(left==tree[i].left&&right==tree[i].right) { aans+=tree[i].sum; return ; } int mid=(tree[i].left+tree[i].right)>>1; if(right<=mid) queryregion(i<<1,left,right); else if(left>mid) queryregion(i<<1|1,left,right); else { queryregion(i<<1,left,mid); queryregion(i<<1|1,mid+1,right); }}int main(){ __int64 n,m; __int64 t=1; while(~scanf("%I64d",&n)) { printf("Case #%I64d:\n",t++); for(int i=1;i<maxn*4;i++) { tree[i].lazy=1; tree[i].left=0; tree[i].right=0; tree[i].sum=0; a[i]=0; } for(int i=1;i<=n;i++) scanf("%I64d",&a[i]); build(1,1,n); //show(1,1,n); scanf("%I64d",&m); for(int i=1;i<=m;i++) { int l,r,type; scanf("%d%d%d",&type,&l,&r); if(l>r) swap(l,r); else ; if(type==0) updateregion(1,l,r);//show(1,1,n); else { //show(1,1,n); aans=0; queryregion(1,l,r); printf("%I64d\n",aans); } } printf("\n"); }}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- 开山之作
- redis必杀命令:键(key)
- dedecms 模板文件不存在,无法解析文档"的终极各种解决办法
- MQ、JMS以及ActiveMQ
- MySQL-MMM框架
- HDU
- hdu 2642 Stars (二维树状数组)
- Java 工程与 Eclipse 高级用法
- 第一行代码 第六章 数据储存方案
- leetcode55-jump game
- Android图片缓存之Bitmap详解(一)
- effect java 学习摘要(7)
- 电子设计之国赛准备-----(前言)
- 设计模式-抽象工厂模式 C++实现