Mobile phones
来源:互联网 发布:ubuntu使用拼音输入法 编辑:程序博客网 时间:2024/05/21 19:33
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.
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
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.
0 41 1 2 32 0 0 2 2 1 1 1 21 1 2 -12 1 1 2 3 3
Sample Output
34
题解:二维的单点修改,求和。
#include<iostream>#include<stdio.h>using namespace std;const int Maxn=1030;int n,c[Maxn][Maxn];int lowbit(int x){ return x&(-x);}void updata(int x,int y,int val){ for(int i=x;i<=n;i+=lowbit(i)) for(int j=y;j<=n;j+=lowbit(j)) c[i][j]+=val;}int getSum(int x,int y){ int ret=0; for(int i=x;i>0;i-=lowbit(i)) for(int j=y;j>0;j-=lowbit(j)) ret+=c[i][j]; return ret;}int main(){ //freopen("in.txt","r",stdin); int dir,x1,y1,x2,y2,val; while(1){ scanf("%d",&dir); if(dir==0){ scanf("%d",&n); for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) c[i][j]=0; } else if(dir==1){ scanf("%d%d%d",&x1,&y1,&val); updata(x1+1,y1+1,val); } else if(dir==2){ scanf("%d%d%d%d",&x1,&y1,&x2,&y2); printf("%d\n",getSum(x2+1,y2+1)-getSum(x2+1,y1)-getSum(x1,y2+1)+getSum(x1,y1)); } else break; }}
阅读全文
0 0
- 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
- POJ 1195 Mobile phones
- 『ORACLE』更改host主机名(11g)
- C++中的vector文件
- Kafka集群搭建详细步骤
- Mysql数据库(一)学习-安装
- Linux常用命令实例详解(N
- Mobile phones
- 看程序“猿”花式虐产品“狗”_你想怎么玩?
- java实现插入排序
- vfork,进程树,exec函数族,system函数
- 老司机浅谈linux系统学习技巧
- css3布局的若干笔记总结
- SNMP/MIB/LOCATE/GREP/OID/SNMP V1 / V2c Error Messages
- AnkuLua: 遊戲自動化|不限時間玩工具App
- spark 2.1 Aggregator