HDU 1892 See you~【树状数组】
来源:互联网 发布:linux 网盘 编辑:程序博客网 时间:2024/05/18 03:19
See you~
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2658 Accepted Submission(s): 841
Problem Description
Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good friends. I want to say sorry to Mr, Yin, I must leave now ~~>.<~~. I am very sorry, we could not advanced to the World Finals last year.
When coming into our training room, a lot of books are in my eyes. And every time the books are moving from one place to another one. Now give you the position of the books at the early of the day. And the moving information of the books the day, your work is to tell me how many books are stayed in some rectangles.
To make the problem easier, we divide the room into different grids and a book can only stayed in one grid. The length and the width of the room are less than 1000. I can move one book from one position to another position, take away one book from a position or bring in one book and put it on one position.
When coming into our training room, a lot of books are in my eyes. And every time the books are moving from one place to another one. Now give you the position of the books at the early of the day. And the moving information of the books the day, your work is to tell me how many books are stayed in some rectangles.
To make the problem easier, we divide the room into different grids and a book can only stayed in one grid. The length and the width of the room are less than 1000. I can move one book from one position to another position, take away one book from a position or bring in one book and put it on one position.
Input
In the first line of the input file there is an Integer T(1<=T<=10), which means the number of test cases in the input file. Then N test cases are followed.
For each test case, in the first line there is an Integer Q(1<Q<=100,000), means the queries of the case. Then followed by Q queries.
There are 4 kind of queries, sum, add, delete and move.
For example:
S x1 y1 x2 y2 means you should tell me the total books of the rectangle used (x1,y1)-(x2,y2) as the diagonal, including the two points.
A x1 y1 n1 means I put n1 books on the position (x1,y1)
D x1 y1 n1 means I move away n1 books on the position (x1,y1), if less than n1 books at that position, move away all of them.
M x1 y1 x2 y2 n1 means you move n1 books from (x1,y1) to (x2,y2), if less than n1 books at that position, move away all of them.
Make sure that at first, there is one book on every grid and 0<=x1,y1,x2,y2<=1000,1<=n1<=100.
For each test case, in the first line there is an Integer Q(1<Q<=100,000), means the queries of the case. Then followed by Q queries.
There are 4 kind of queries, sum, add, delete and move.
For example:
S x1 y1 x2 y2 means you should tell me the total books of the rectangle used (x1,y1)-(x2,y2) as the diagonal, including the two points.
A x1 y1 n1 means I put n1 books on the position (x1,y1)
D x1 y1 n1 means I move away n1 books on the position (x1,y1), if less than n1 books at that position, move away all of them.
M x1 y1 x2 y2 n1 means you move n1 books from (x1,y1) to (x2,y2), if less than n1 books at that position, move away all of them.
Make sure that at first, there is one book on every grid and 0<=x1,y1,x2,y2<=1000,1<=n1<=100.
Output
At the beginning of each case, output "Case X:" where X is the index of the test case, then followed by the "S" queries.
For each "S" query, just print out the total number of books in that area.
For each "S" query, just print out the total number of books in that area.
Sample Input
23S 1 1 1 1A 1 1 2S 1 1 1 13S 1 1 1 1A 1 1 2S 1 1 1 2
Sample Output
Case 1:13Case 2:14
Author
Sempr|CrazyBird|hust07p43
Source
HDU 2008-4 Programming Contest
Recommend
lcy
二维树状数组。
代码
#include <iostream>#include <algorithm>#include <cstdio>#include <string.h>using namespace std;int aa[1005][1005]={0},bb[1005][1005];int lowbit(int x){ return x&(-x);}int sum(int x,int y){ int ans=0; int i,j; for(i=x;i>0;i-=lowbit(i)) for(j=y;j>0;j-=lowbit(j)) { ans+=aa[i][j]; } return ans;}int updata(int x,int y,int a){ int i,j; for(i=x;i<=1001;i+=lowbit(i)) for(j=y;j<=1001;j+=lowbit(j)) aa[i][j]+=a;}int main(){ int total,tt,i,j,sss,cc=0,maxx,maxy,minx,miny; int x1,y1,x2,y2,add; char ss; scanf("%d",&total); for(int ii=1;ii<=total;ii++) { for(i=1;i<=1001;i++) for(j=1;j<=1001;j++) { aa[i][j]=lowbit(i)*lowbit(j);//updata(i,j,1); bb[i][j]=1; } scanf("%d",&tt); printf("Case %d:\n",ii); while(tt--) { getchar(); scanf("%c",&ss); if(ss=='S') { scanf("%d%d%d%d",&x1,&y1,&x2,&y2); x1++;y1++;x2++;y2++;//数据范围从0到1000 maxx=x1>x2?x1:x2; minx=x1>x2?x2:x1; maxy=y1>y2?y1:y2; miny=y1>y2?y2:y1; cc+=sum(maxx,maxy); cc+=sum(minx-1,miny-1); cc-=sum(minx-1,maxy); cc-=sum(maxx,miny-1); printf("%d\n",cc); cc=0; } else if(ss=='A') { scanf("%d%d%d",&x1,&y1,&add); x1++;y1++; updata(x1,y1,add); bb[x1][y1]+=add; } else if(ss=='D') { scanf("%d%d%d",&x1,&y1,&add); x1++;y1++; if(bb[x1][y1]>add) { add*=(-1); updata(x1,y1,add); bb[x1][y1]+=add; } else { updata(x1,y1,(-1)*bb[x1][y1]); bb[x1][y1]=0; } } else if(ss=='M') { scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&add); x1++;y1++;x2++;y2++; if(bb[x1][y1]>add) { updata(x1,y1,(-1)*add); bb[x1][y1]-=add; updata(x2,y2,add); bb[x2][y2]+=add; } else { updata(x1,y1,(-1)*bb[x1][y1]); updata(x2,y2,bb[x1][y1]); bb[x2][y2]+=bb[x1][y1]; bb[x1][y1]=0; } } } } return 0;}
- HDU 1892 See you~ 二维树状数组
- hdu 1892 see you ~(二维树状数组)
- HDU 1892 See you~【树状数组】
- hdu-1892-See you~ 二维树状数组
- hdu 1892 See you~(二维树状数组)
- 二维树状数组 hdu 1892 See you~
- HDU 1892 See you~ (二维树状数组)
- hdu 1892 See you~(二维树状数组)
- 【树状数组+二维】杭电 hdu 1892 See you~
- HDU 1892 See you~(经典二维树状数组)
- HDU 1892 See you~(二维树状数组)
- Hdu 1892 step5.3.1 See you~(树状数组)
- hdu 1892 See you~(二维树状数组)
- hdu 1892 See you~(二维树状数组)
- HDU 1892 See you~(二维树状数组 单点更新)
- hdu-See you~(二维树状数组)
- hduu 1892 see you~~~二维树状数组
- HDOJ 1892 See you~ 树状数组
- UVa 10098: Generating Fast
- Hibernate数据缓存
- Qt 中的多线程
- (Hibernate学习篇)hibernate的高级技术
- Java反射机制的原理及在Android下的简单应用
- HDU 1892 See you~【树状数组】
- 调用scanf函数,并从键盘想数组输入数据
- undo 表空间损坏导致无法open
- Effective Java 第7条:避免使用终结函数
- 基于嵌入式OS的任务设计-----任务划分
- shell启动另一个脚本进行统计,awk在每一行添加当前时间
- (一)、PHP+Apache+Mysql+PhpMyadmin环境搭建
- 缺点
- LLVM在警告方面的改进 @ WWDC 2013