HDU 1892 See you~ (二维树状数组)
来源:互联网 发布:unity3d 5.x破解工具 编辑:程序博客网 时间:2024/05/21 02:21
See you~
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 5662 Accepted Submission(s): 1799
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
思路:二维树状数组
题目给出坐标范围包含0,树状数组下标从1开始,因此将输入坐标+1计算(否则容易TLE)
AC代码:
#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>using namespace std;const int maxn=1000+50;const int INF=0x3f3f3f3f;int bit[maxn][maxn];int N=maxn;int lowbit(int x){ return x&(-x);}void add(int x,int y,int val){ while(x < N){ int tmp = y; while(tmp < N){ bit[x][tmp] += val; tmp += lowbit(tmp); } x += lowbit(x); }}int sum(int x,int y){ int ans = 0; while(x > 0){ int tmp = y; while(tmp > 0){ ans += bit[x][tmp]; tmp -= lowbit(tmp); } x -= lowbit(x); } return ans;}int solve(int x,int y){ return sum(x,y)-sum(x-1,y)-sum(x,y-1)+sum(x-1,y-1);}int main(){ int t; scanf("%d",&t); for(int ca=1;ca<=t;ca++){ memset(bit,0,sizeof(bit)); for(int i=1;i<N;i++) for(int j=1;j<N;j++) add(i,j,1); printf("Case %d:\n",ca); int q; scanf("%d",&q); while(q--){ char str[5]; int x1,x2,y1,y2; int n1; scanf("%s",str); if(str[0]=='S'){ scanf("%d%d%d%d",&x1,&y1,&x2,&y2); if(x1>x2) swap(x1,x2); if(y1>y2) swap(y1,y2); int res=sum(x2+1,y2+1)+sum(x1,y1)-sum(x2+1,y1)-sum(x1,y2+1); printf("%d\n",res); } else if(str[0]=='A'){ scanf("%d%d%d",&x1,&y1,&n1); add(x1+1,y1+1,n1); } else if(str[0]=='D'){ scanf("%d%d%d",&x1,&y1,&n1); int res=solve(x1+1,y1+1); int m=min(res,n1); add(x1+1,y1+1,-m); } else if(str[0]=='M'){ scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&n1); //x1++; x2++; y1++; y2++; int res=solve(x1+1,y1+1); int m=min(res,n1); add(x1+1,y1+1,-m); add(x2+1,y2+1,m); } } } return 0;}
阅读全文
0 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-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~(二维树状数组 单点更新)
- hduu 1892 see you~~~二维树状数组
- See you~(二维树状数组)
- HDU 1892 See you~【树状数组】
- HDU 1892 See you~ 二维树状数组更新点查找区间
- webservice之axis2客户端调用(maven方式创建java项目)
- 51nod 1097 拼成最小的数
- spring的零配置
- [js]css导航栏细究
- 欢迎使用CSDN-markdown编辑器
- HDU 1892 See you~ (二维树状数组)
- TP框架中D方法与M方法的区别
- 一句话之二叉树的LCA
- 红黑树删除
- 实现简单的聊天功能部分Vue
- 《Axure RP 8 实战手册》pdf
- javascript鼠标事件
- Java, c++ 中序和前序 或 中序和后序构建二叉树
- SSH key