POJ 1195 Mobile phones
来源:互联网 发布:查询域名对应的ip地址 编辑:程序博客网 时间:2024/06/05 02:05
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
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
第一道自己A的树状数组耶~还是二维的~(虽然和楼教主那道一样~)
裸二维树状数组,注意x1,y1,x2,y2的位置和加一之类的条件就可以了~具体看代码~
#include<cstdio>int n,t,a[1025][1025],x1,x2,y1,y2,val,tot;int lowbit(int u){return u&(-u);}void add(int u,int v,int va){for(int i=u;i<=n;i+=lowbit(i)) for(int j=v;j<=n;j+=lowbit(j)) a[i][j]+=va;}int getnum(int u,int v){int ans=0;for(int i=u;i;i-=lowbit(i)) for(int j=v;j;j-=lowbit(j)) ans+=a[i][j];return ans;}int main(){scanf("%d%d",&t,&n);while(scanf("%d",&t)==1 && t!=3){if(t==1){scanf("%d%d%d",&x1,&y1,&val);add(x1+1,y1+1,val);}if(t==2){tot=0;scanf("%d%d%d%d",&x1,&y1,&x2,&y2);x1++;y1++;x2++;y2++;tot=getnum(x2,y2)-getnum(x2,y1-1)-getnum(x1-1,y2)+getnum(x1-1,y1-1);printf("%d\n",tot);}}return 0;}
1 0
- 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
- servletcontext读取web资源文件
- Unity打包到Android错误解决
- 易犯的错误(实时更新)
- 【CTO CLUB微课】理论到实践,金牌讲师全面剖析Scrum精髓
- poj 2503 map应用 与 C 输入问题
- POJ 1195 Mobile phones
- UVA - 10673 Play with Floor and Ceil(手动解方程)
- 探秘Java字符串桃花源
- 【HDU】2069 - Coin Change(暴力)
- web应用中普通java程序读取资源文件
- ATU 从新出发
- C/C++怎样通过预定义宏识别编译器名称和版本
- Xcode-block
- HTML5入门大二下暑假总结---1