POJ 1195 Mobile phones
来源:互联网 发布:好玩的竖屏网络哟西 编辑:程序博客网 时间:2024/05/16 09:54
Mobile phones
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12408 Accepted: 5718
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
二维树状数组模版
二维树状数组模版
/*************************************************************** > File Name: mobile.cpp > Author: SDUT_GYX > Mail: 2272902662@qq.com > Created Time: 2013/6/4 16:49:02 **************************************************************/#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include <cstdlib>#include <iomanip>#include <string>#include <vector>#include <map>#include <cmath>#include <stack>#define LL long long#define N 1050using namespace std;int a[N][N];int n;int main(){//freopen("data1.in","r",stdin);void update(int x,int y,int val);int get_sum(int x,int y);int k;while(scanf("%d",&k)!=EOF){if(k==3){break;}if(k==0){scanf("%d",&n);memset(a,0,sizeof(a));continue;}if(k==1){int x,y,val;scanf("%d %d %d",&x,&y,&val);x++; y++;update(x,y,val);continue;}if(k==2){int s=0;int x1,y1,x2,y2;scanf("%d %d %d %d",&x1,&y1,&x2,&y2);x1++; y1++; x2++; y2++;s=get_sum(x2,y2) - get_sum(x1-1,y2) - get_sum(x2,y1-1) + get_sum(x1-1,y1-1);printf("%d\n",s);}}return 0;}int find(int y){return y&(-y);}void update(int x,int y,int val){while(x<=n){int j=y;while(j<=n){a[x][j] +=val;j+=find(j);}x += find(x);}}int get_sum(int x,int y){int s=0;while(x>0){int j=y;while(j>0){s+=a[x][j];j-=find(j);}x-=find(x);}return s;}
- POJ 1195 Mobile phones
- poj 1195 Mobile phones
- poj 1195 Mobile phones
- poj 1195 mobile phones
- POJ 1195 Mobile phones
- Poj 1195 Mobile phones
- poj 1195 Mobile phones
- POJ 1195 Mobile phones
- POJ 1195 Mobile phones
- POJ 1195 Mobile phones
- POJ 1195 Mobile phones
- POJ 1195 Mobile phones
- poj 1195 Mobile phones
- poj 1195 Mobile phones
- POJ 1195 Mobile phones
- POJ 1195 Mobile Phones
- POJ 1195 Mobile phones
- POJ 1195 Mobile phones
- 关于游戏打击感
- ~/Telerik.Web.UI.WebResource.axd' is missing in web.config
- DB2 SQL性能调优秘笈
- 斯坦福机器学习公开课笔记(六)--神经网络的学习
- 从程序员到项目经理(11):每个人都是管理者
- POJ 1195 Mobile phones
- 更新centos默认启动命令版本
- 关于SQL 中的单引号和双引号
- CXF发布Rest服务出现错误:javax.xml.bind.JAXBException:以及其任何超类对此上下文都是未知的。
- 数学之路(3)-数据分析(4)
- 取代top工具的Linux运维利器--htop
- 从程序员到项目经理(12):如何管理自己的时间(上)
- 其实,反射还有另一种功能
- biee登陆界面修改