K - Mobile phones
18001 단어 데이터 구조연습 하 다.
Memory Limit: 65536KB
64bit IO Format: %I64d & %I64u
[Submit] [Go Back] [Status]
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
#include
#include #include #include using namespace std; #define MAXN 1300 int c[MAXN][MAXN]; int n; int lowbit(int x) { return x&(-x); } void updata(int x,int y,int value) { int i,j; for(i=x;i<=n;i+=lowbit(i)) for(j=y;j<=n;j+=lowbit(j)) c[i][j]+=value; } int query(int x,int y) { int i,j; int sum=0; for(i=x;i>0;i-=lowbit(i)) for(j=y;j>0;j-=lowbit(j)) { sum+=c[i][j]; } return sum; } int main() { int t; while(scanf("%d",&t)!=EOF) { if(t==0) { scanf("%d",&n); memset(c,0,sizeof(c)); } else if(t==1) { int x,y,val; scanf("%d%d%d",&x,&y,&val); updata(x+1,y+1,val); } else if(t==2) { int ans; int x1,y2,x2,y1; scanf("%d%d%d%d",&x1,&y1,&x2,&y2); ans=query(x1,y1)+query(x2+1,y2+1)-query(x1,y2+1)-query(x2+1,y1); printf("%d
",ans); } else if(t==3)break; } return 0; }
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
U - Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KB The little cat is so famous, that many couples tramp over hill and dale to Byte...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.