Mobile phones(poj1195)

Mobile phones

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 18453		Accepted: 8542

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
思路：二维树状数组；
裸题；

 1 #include<stdio.h>
 2 #include<algorithm>
 3 #include<iostream>
 4 #include<stdlib.h>
 5 #include<queue>
 6 #include<string.h>
 7 using namespace std;
 8 int bit[1030][1030];
 9 int lowbit(int x)
10 {
11         return x&(-x);
12 }
13 void add(int x,int y,int a)
14 {
15         int i,j;
16         for(i = x; i <= 1025; i+=lowbit(i))
17         {
18                 for(j = y; j <= 1025; j+=lowbit(j))
19                 {
20                         bit[i][j]+=a;
21                 }
22         }
23 }
24 int ask(int x,int y)
25 {
26         int i,j;
27         int sum = 0;
28         for(i = x; i > 0; i-=lowbit(i))
29         {
30                 for(j = y; j > 0; j-=lowbit(j))
31                 {
32                         sum += bit[i][j];
33                 }
34         }
35         return sum;
36 }
37 int main(void)
38 {
39         int i,j,k;
40         while(scanf("%d",&k))
41         {
42                 if(k == 3)
43                         break;
44                 else if(k == 0)
45                 {
46                         memset(bit,0,sizeof(bit));
47                         int n;
48                         scanf("%d",&n);
49                 }
50                 else if(k == 1)
51                 {
52                         int x,y,a;
53                         scanf("%d %d %d",&x,&y,&a);
54                         x++;y++;
55                         add(x,y,a);
56                 }
57                 else if(k == 2)
58                 {
59                         int L,B,R,T;
60                         scanf("%d %d %d %d",&L,&B,&R,&T);
61                         L++,B++,R++,T++;
62                         int sum = ask(R,T);
63                         sum -= ask(L-1,T);
64                         sum -= ask(R,B-1);
65                         sum += ask(L-1,B-1);
66                         printf("%d\n",sum);
67                 }
68         }
69         return 0;
70 }