HDU 1892 See you~(二维树状数组 单点更新)
来源:互联网 发布:sql分页查询语句join 编辑:程序博客网 时间:2024/06/04 23:28
See you~
Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 5646 Accepted Submission(s): 1795
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
POINT:
注意没说给你的点是左上和右下,要判一下。
#include <iostream>#include <stdio.h>#include <string.h>#include <math.h>#include <algorithm>using namespace std;#define LL long longconst int N = 1001;int mp[N+5][N+5];int sum[N+5][N+5];int lowbit(int x){ return x&-x;}void add(int x,int y,int a){ for(int i=x;i<=N;i+=lowbit(i)) { for(int j=y;j<=N;j+=lowbit(j)) { sum[i][j]+=a; } }}int query(int x,int y){ int ans=0; for(int i=x;i>=1;i-=lowbit(i)) { for(int j=y;j>=1;j-=lowbit(j)) ans+=sum[i][j]; } return ans;}int main(){ int T; scanf("%d",&T); int o=0; while(T--) { int n; scanf("%d",&n); memset(sum,0,sizeof sum); for(int i=1;i<=N;i++) { for(int j=1;j<=N;j++) { mp[i][j]=1; add(i,j,1); } } int x1,x2,y1,y2,n1; printf("Case %d:\n",++o); while(n--) { char c; getchar(); scanf("%c",&c); if(c=='S') { scanf("%d %d %d %d",&x1,&y1,&x2,&y2); x1++,y1++,x2++,y2++; if(x1>x2) swap(x1,x2); if(y1>y2) swap(y1,y2); printf("%d\n",query(x2,y2)+query(x1-1,y1-1)-query(x1-1,y2)-query(x2,y1-1)); } else if(c=='A') { scanf("%d %d %d",&x1,&y1,&n1); x1++,y1++; mp[x1][y1]+=n1; add(x1,y1,n1); } else if(c=='D') { scanf("%d %d %d",&x1,&y1,&n1); x1++,y1++; if(mp[x1][y1]<n1) n1=mp[x1][y1],mp[x1][y1]=0; else mp[x1][y1]-=n1; add(x1,y1,-n1); } else if(c=='M') { scanf("%d %d %d %d %d",&x1,&y1,&x2,&y2,&n1); x1++,y1++,x2++,y2++; if(mp[x1][y1]<n1) n1=mp[x1][y1],mp[x1][y1]=0; else mp[x1][y1]-=n1; mp[x2][y2]+=n1; add(x1,y1,-n1); add(x2,y2,n1); } } }}
阅读全文
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 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~~~二维树状数组
- Camera---获得摄像机的视口区域(转载大神雨松MOMO)
- Educational Codeforces Round 26 A. Text Volume
- Java上传Excel并解析
- 简单布隆过滤器实现、布隆过滤器扩展
- [转]深度学习如何入门?
- HDU 1892 See you~(二维树状数组 单点更新)
- window下eclipse ndk配置
- Kail Linux fluxion WiFi破解
- 百度传课-php2小时超音速入门
- 在大学老师布置的一些题目,欢迎各位大佬指正(6)
- 大数据学习笔记:编写Mapreduce代码并运行
- php增删改
- C#版SQLite的备份和还原
- Android JNI对象与Java对象的绑定