zoukankan      html  css  js  c++  java
  • POJ1195(二维树状数组)

    Mobile phones
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 17176   Accepted: 7920

    Description

    Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and columns numbered from 0 to S-1. Each square contains a base station. The number of active mobile phones inside a square can change because a phone is moved from a square to another or a phone is switched on or off. At times, each base station reports the change in the number of active phones to the main base station along with the row and the column of the matrix. 

    Write a program, which receives these reports and answers queries about the current total number of active mobile phones in any rectangle-shaped area. 

    Input

    The input is read from standard input as integers and the answers to the queries are written to standard output as integers. The input is encoded as follows. Each input comes on a separate line, and consists of one instruction integer and a number of parameter integers according to the following table. 

    The values will always be in range, so there is no need to check them. In particular, if A is negative, it can be assumed that it will not reduce the square value below zero. The indexing starts at 0, e.g. for a table of size 4 * 4, we have 0 <= X <= 3 and 0 <= Y <= 3. 

    Table size: 1 * 1 <= S * S <= 1024 * 1024 
    Cell value V at any time: 0 <= V <= 32767 
    Update amount: -32768 <= A <= 32767 
    No of instructions in input: 3 <= U <= 60002 
    Maximum number of phones in the whole table: M= 2^30 

    Output

    Your program should not answer anything to lines with an instruction other than 2. If the instruction is 2, then your program is expected to answer the query by writing the answer as a single line containing a single integer to standard output.

    Sample Input

    0 4
    1 1 2 3
    2 0 0 2 2 
    1 1 1 2
    1 1 2 -1
    2 1 1 2 3 
    3
    

    Sample Output

    3
    4
    二维树状数组模板题。
    #include"cstdio"
    #include"cstring"
    using namespace std;
    const int MAXN=1024+5;
    int bit[MAXN][MAXN];
    int lowbit(int i)
    {
        return i&(-i);
    }
    void add(int x,int y,int a)
    {
        for(int i=x;i<MAXN;i+=lowbit(i))
            for(int j=y;j<MAXN;j+=lowbit(j))
                bit[i][j]+=a;
    }
    long long sum(int x,int y)
    {
        long long s=0;
        for(int i=x;i>0;i-=lowbit(i))
            for(int j=y;j>0;j-=lowbit(j))
                s+=bit[i][j];
        return s;
    }
    long long getSum(int x1,int y1,int x2,int y2)
    {
        return sum(x2,y2)+sum(x1-1,y1-1)-sum(x2,y1-1)-sum(x1-1,y2);
    }
    int main()
    {
        int Init;
        while(scanf("%d",&Init)!=EOF)
        {
            int n;
            if(Init==0)
            {
                scanf("%d",&n);
                memset(bit,0,sizeof(bit));
            }
            else if(Init==1)
            {
                int x,y,a;
                scanf("%d%d%d",&x,&y,&a);
                x++,y++;
                add(x,y,a);
            }
            else if(Init==2)
            {
                int L,B,R,T;
                scanf("%d%d%d%d",&L,&B,&R,&T);
                L++,B++,R++,T++;
                printf("%I64d
    ",getSum(L,B,R,T));
            }
            else
            {
                break;
            }
        }
        
        return 0;
    }
  • 相关阅读:
    runtest.sh
    写代码:简单的三元运算
    写代码:用户交互显示类似省市县三级联动的选择
    写代码:列举布尔值是False的所有值
    写代码:求集合
    写代码:利用For循环和while输出1-100
    写代码:利用for循环和range输出9*9乘法表
    写代码:查找列表中元素,移除每个元素的空格,并查找以a或A开头并且以c结尾的元素。
    写代码:利用下划线将列表的每个元素拼接成字符串,li=["alex","eric","rain"]
    写代码:购物车程序
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5140683.html
Copyright © 2011-2022 走看看