• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 74,  comments - 33,  trackbacks - 0
            Mobile phones
            Time Limit: 5000MS Memory Limit: 65536K
            Total Submissions: 4128 Accepted: 1616

            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
            我暈了。。。。。今天腦殘了
            今天腦白癡了。。。。。居然想當(dāng)然。。。首先因?yàn)樽兞繉?xiě)錯(cuò)RE N次 后來(lái)腦殘wa N次
            腦殘到居然矩形(x1,y1)(x2,y2)控制矩形面積我腦殘的居然直接相減,看來(lái)我真的是殘障人士。。。。。
            腦殘了今天。。。。。不過(guò)還好終于自己調(diào)過(guò)了。。。。。Faint。。。。oaoaoaoaooaoaoao。。。。。。
            二維樹(shù)狀數(shù)組代碼如下:
            int?Lowbit(int?now){
            ????
            return?(now&(-now));
            }

            void?add(int?x,int?y,int?now){
            ????
            if(num[x][y]+now<0){
            ????????now
            =-num[x][y];
            ????????num[x][y]
            =0;
            ????}

            ????
            else?num[x][y]+=now;
            ????
            for(int?i=x;i<=n;i+=Lowbit(i))
            ????????
            for(int?j=y;j<=n;j+=Lowbit(j)){
            ????????????tree[i][j]
            +=now;
            ????????}

            ????
            return?;
            }

            int?sum(int?x,int?y){
            ????
            int?all=0;
            ????
            for(int?i=x;i>0;i-=Lowbit(i))
            ????????
            for(int?j=y;j>0;j-=Lowbit(j))
            ????????????all
            +=tree[i][j];
            ????
            return?all;
            }
            posted on 2009-03-18 20:42 KNIGHT 閱讀(172) 評(píng)論(1)  編輯 收藏 引用

            FeedBack:
            # re: 1195 Mobile phones
            2009-05-07 13:49 | Anyone
            居然搜到你這里來(lái)了。。。

            這題我開(kāi)始也腦殘了。。。。。哎  回復(fù)  更多評(píng)論
              

            只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問(wèn)   Chat2DB   管理


            <2009年5月>
            262728293012
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            久久99国产亚洲高清观看首页| 伊人久久综合精品无码AV专区| 久久综合九色综合网站| 中文字幕无码免费久久| 国产美女亚洲精品久久久综合| 久久婷婷国产综合精品 | 色8久久人人97超碰香蕉987| 亚洲综合久久综合激情久久| 亚洲伊人久久大香线蕉苏妲己| 免费精品久久久久久中文字幕| 亚洲日本久久久午夜精品| 久久久久人妻一区二区三区vr| 91精品久久久久久无码| 精品久久久久久中文字幕大豆网| 国产精品一久久香蕉国产线看| 久久精品国产亚洲Aⅴ香蕉| 亚洲AV无码久久| 久久伊人色| 18岁日韩内射颜射午夜久久成人| 欧美激情精品久久久久久| 国产精品一区二区久久| 久久久久亚洲精品日久生情| 久久香蕉国产线看观看乱码| 日韩人妻无码一区二区三区久久 | 国产午夜福利精品久久2021 | 久久精品九九亚洲精品天堂| 老男人久久青草av高清| 国产精品嫩草影院久久| 国产精品美女久久久久网| 无码任你躁久久久久久老妇App| 国产精品日韩深夜福利久久| 精品久久久久久国产潘金莲| 亚洲精品无码久久久| 久久se这里只有精品| 91精品国产综合久久香蕉| 久久久久综合网久久| 久久99精品国产99久久6男男| 亚洲中文字幕无码久久2020| 综合久久精品色| 色老头网站久久网| 欧美日韩久久中文字幕|