zoukankan      html  css  js  c++  java
  • POJ-1195 Mobile phones 【树状数组+二维】

    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


    思路:
    二维Fenwick模板题

     1 #include<iostream>
     2 #include<algorithm>
     3 #include<cstring>
     4 using namespace std;
     5 typedef long long LL;
     6 const int maxn = 1050;
     7 LL C[maxn][maxn], s;
     8 
     9 int lowbit(int x) {return x & -x;}
    10 
    11 void add(int x, int y, int d) {
    12     for (int i = x; i <= s; i += lowbit(i))
    13         for (int j = y; j <= s; j += lowbit(j)) {
    14             C[i][j] += d;
    15             if (C[i][j] < 0) C[i][j] = 0;
    16         }
    17 }
    18 
    19 LL sum(int x, int y) {
    20     int ret = 0;
    21     for (int i = x; i > 0; i -= lowbit(i))
    22         for (int j = y; j > 0; j -= lowbit(j)) 
    23             ret += C[i][j];
    24     return ret;
    25 } 
    26 
    27 int main() {
    28     ios::sync_with_stdio(false);
    29     int k, x, y, b, t, l, r, a;
    30     while(cin >> k >> s) {
    31         memset(C, 0, sizeof(C));
    32         while (cin >> k, k != 3) {
    33             if (k == 1) {
    34                 cin >> x >> y >> a;
    35                 add(x+1, y+1, a);
    36             }
    37             else if (k == 2) {
    38                 cin >> l >> b >> r >> t;
    39                 cout << sum(r+1, t+1)+sum(l, b)-sum(r+1, b)-sum(l, t+1) << endl;
    40             }
    41         }
    42     }
    43 
    44     return 0;
    45 }
  • 相关阅读:
    高度地形Unity3D 通过代码导入自定义格式地形的方法
    初始化提交CI跟swfupload结合 出现302的解决方案
    文件信息我的学习生涯(Delphi篇) 11
    相机三星如果我可以设计HTC ONE的相机
    数据数据库Apache Derby数据库
    安装索引源码阅读工具 lxr 安装配置初探
    模板替换php实战 第三天
    应用程序安装实验四十六微软应用程序虚拟化之一APPV 5.1服务器部署
    函数应用SAEPython教程(一) 在SAE上进行Python的开发
    消息方法熬之滴水穿石:Delphi曾经的利器(5)
  • 原文地址:https://www.cnblogs.com/robin1998/p/6519022.html
Copyright © 2011-2022 走看看