1195.Mobile phones
来源:互联网 发布:知乎 保利,金茂 编辑:程序博客网 时间:2024/06/04 19:23
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 18811 Accepted: 8681
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.
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
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 41 1 2 32 0 0 2 2 1 1 1 21 1 2 -12 1 1 2 3 3
Sample Output
34
Source
IOI 2001
tips:二维树状数组水题,上次题跟这个一样,不做解释了
#include <iostream>#include <stdio.h>#include <string>using namespace std;int S;int lowbit(int i) {return i & (-i);}void add(int x,int y,int A,int **map){ for (int n =x;n <= S;n += lowbit(n)) for (int m = y;m <= S;m += lowbit(m)) map[n][m] += A;}int find(int x,int y,int **map){ int answer = 0; for (int n =x;n >= 1;n -= lowbit(n)) for (int m = y;m >= 1;m -= lowbit(m)) answer += map[n][m]; return answer;}int main(){ int tmp; scanf("%d%d",&tmp,&S); int ** map = new int *[S+1]; for (int n = 0;n <= S;n++) { map[n] = new int [S+1]; for (int m = 0;m <= S;m++) map[n][m] = 0; } while (scanf("%d",&tmp) && tmp != 3) { switch (tmp) { case 1: int X,Y,A; scanf("%d%d%d",&X,&Y,&A); X++,Y++; add(X,Y,A,map); break; case 2: int x1,x2,y1,y2; scanf("%d%d%d%d",&x1,&y1,&x2,&y2); x2++,y2++; int answer = find(x2,y2,map) - find(x1,y2,map) - find(x2,y1,map) + find(x1,y1,map); printf("%d\n",answer); break; } } return 0;}
0 0
- 1195.Mobile phones
- Mobile phones
- Mobile phones
- Mobile phones
- Mobile phones
- POJ 1195 Mobile phones
- poj 1195 Mobile phones
- poj 1195 Mobile phones
- poj 1195 mobile phones
- K - Mobile phones
- POJ 1195 Mobile phones
- Poj 1195 Mobile phones
- 【树状数组】Mobile Phones
- POJ1195 Mobile phones
- poj1195 Mobile phones
- poj 1195 Mobile phones
- poj1195 Mobile phones
- POJ 1195 Mobile phones
- HDG深圳站:不仅是一场沙龙,更是一段情怀
- Java设计模式之十--命令模式 (管理智能家电)
- gcc简单使用
- 二叉树的下一个结点
- IoT设备最佳实践-5个面向软件供应链的问题
- 1195.Mobile phones
- GMM的EM算法推导
- 各种数据类型在Win32和Win64系统下所占用的字节数(C语言)
- Jquery-表单选择器
- Java学习——helloJava
- python小结
- 【OpenCV入门教程之九】 非线性滤波专场:中值滤波、双边滤波
- 6.6
- strcpy sprintf memcpy 区别