zoukankan      html  css  js  c++  java
  • hdu-1892-二维BIT

    See you~

    Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
    Total Submission(s): 6520    Accepted Submission(s): 2040


    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. 
     
    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. 
     
    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. 
     
    Sample Input
    2 3 S 1 1 1 1 A 1 1 2 S 1 1 1 1 3 S 1 1 1 1 A 1 1 2 S 1 1 1 2
     
    Sample Output
    Case 1: 1 3 Case 2: 1 4
     
    Author
    Sempr|CrazyBird|hust07p43
     
    Source
      
      二维BIT的模板题,注意S时给出的两个点要自己转换一下保证一个是左上角一个是右下角。
     二维的BIT里面的每个节点是一个矩阵,宽度就是x的lowbit,长度就是y的lowbit,右下角就是(X,Y)。
      
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 #define ULL unsigned long long 
     4 #define LL long long 
     5 LL C[1005][1005];
     6 int A[1005][1005];
     7 inline int lowbit(int x){return x&-x;}
     8 void add(int x,int y,int d){
     9     for(int i=x;i<=1004;i+=lowbit(i))
    10         for(int j=y;j<=1004;j+=lowbit(j))
    11             C[i][j]+=d;
    12 }
    13 LL sum(int x,int y){
    14     LL r=0;
    15     for(int i=x;i>0;i-=lowbit(i))
    16         for(int j=y;j>0;j-=lowbit(j))
    17             r+=C[i][j];
    18     return r;
    19 }
    20 int main(){
    21     int t,x1,x2,y1,y2,n,q,cas=0;
    22     char ch[10];
    23     scanf("%d",&t);
    24     while(t--){
    25         memset(C,0,sizeof(C));
    26         for(int i=1;i<=1004;++i)
    27             for(int j=1;j<=1004;++j) add(i,j,1),A[i][j]=1;
    28         scanf("%d",&q);
    29         printf("Case %d:
    ",++cas);
    30         while(q--){
    31             scanf("%s",ch);
    32             if(ch[0]=='S'){
    33                 scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
    34                 x1++,y1++,x2++,y2++;
    35                 if(x1>x2) swap(x1,x2);
    36                 if(y1>y2) swap(y1,y2);
    37                 printf("%lld
    ",sum(x2,y2)-sum(x1-1,y2)-sum(x2,y1-1)+sum(x1-1,y1-1));
    38             }
    39             else if(ch[0]=='A'){
    40                 scanf("%d%d%d",&x1,&y1,&n);
    41                 x1++,y1++;
    42                 add(x1,y1,n);
    43                 A[x1][y1]+=n;
    44             }
    45             else if(ch[0]=='D'){
    46                 scanf("%d%d%d",&x1,&y1,&n);
    47                 x1++,y1++;
    48                 n=min(n,A[x1][y1]);
    49                 add(x1,y1,-n);
    50                 A[x1][y1]-=n;
    51             }
    52             else if(ch[0]=='M'){
    53                 scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&n);
    54                 x1++,y1++,x2++,y2++;
    55                 n=min(n,A[x1][y1]);
    56                 add(x1,y1,-n),A[x1][y1]-=n;
    57                 add(x2,y2,n),A[x2][y2]+=n;
    58             }
    59         }
    60     }
    61     return 0;
    62 }
     
  • 相关阅读:
    NPM (node package manager) 入门
    win10 环境 gitbash 显示中文乱码问题处理
    javascript中的Array对象 —— 数组的合并、转换、迭代、排序、堆栈
    Javascript 的执行环境(execution context)和作用域(scope)及垃圾回收
    Centos 下 mysql root 密码重置
    执行 $Gulp 时发生了什么 —— 基于 Gulp 的前端集成解决方案(二)
    Java I/O输入输出流详解
    反射---Java高级开发必须懂的
    细说Java多线程之内存可见性
    全面解析java注解
  • 原文地址:https://www.cnblogs.com/zzqc/p/9373808.html
Copyright © 2011-2022 走看看