HDU 2642 Stars(二维树状数组 模板题)
来源:互联网 发布:编译c 的软件 编辑:程序博客网 时间:2024/05/29 13:32
Stars
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 118 Accepted Submission(s): 56Problem Description
Yifenfei is a romantic guy and he likes to count the stars in the sky.
To make the problem easier,we considerate the sky is a two-dimension plane.Sometimes the star will be bright and sometimes the star will be dim.At first,there is no bright star in the sky,then some information will be given as "B x y" where 'B' represent bright and x represent the X coordinate and y represent the Y coordinate means the star at (x,y) is bright,And the 'D' in "D x y" mean the star at(x,y) is dim.When get a query as "Q X1 X2 Y1 Y2",you should tell Yifenfei how many bright stars there are in the region correspond X1,X2,Y1,Y2.
There is only one case.
To make the problem easier,we considerate the sky is a two-dimension plane.Sometimes the star will be bright and sometimes the star will be dim.At first,there is no bright star in the sky,then some information will be given as "B x y" where 'B' represent bright and x represent the X coordinate and y represent the Y coordinate means the star at (x,y) is bright,And the 'D' in "D x y" mean the star at(x,y) is dim.When get a query as "Q X1 X2 Y1 Y2",you should tell Yifenfei how many bright stars there are in the region correspond X1,X2,Y1,Y2.
There is only one case.
Input
The first line contain a M(M <= 100000), then M line followed.
each line start with a operational character.
if the character is B or D,then two integer X,Y (0 <=X,Y<= 1000)followed.
if the character is Q then four integer X1,X2,Y1,Y2(0 <=X1,X2,Y1,Y2<= 1000) followed.
each line start with a operational character.
if the character is B or D,then two integer X,Y (0 <=X,Y<= 1000)followed.
if the character is Q then four integer X1,X2,Y1,Y2(0 <=X1,X2,Y1,Y2<= 1000) followed.
Output
For each query,output the number of bright stars in one line.
Sample Input
5B 581 145B 581 145Q 0 600 0 200D 581 145Q 0 600 0 200
Sample Output
10
没啥好说的。。。注意 范围 0不可取,要都加一。
全局变量默认初始化为0不需要 memset
#include <iostream>#include <algorithm>#include <array>#include <string.h>#include <cmath>#include <stdio.h>using namespace std;int flag[1005][1005];int tree[1005][1005];int low_bit(int x) { return x & (-x);}void update(int pos_x, int pos_y, int value) { for (int i = pos_x ; i <= 1003; i += low_bit(i)) { for (int j = pos_y; j <= 1003; j += low_bit(j)) { tree[i][j] += value; } }}int sum(int pos_x, int pos_y) { int sum = 0; for (int i = pos_x; i > 0; i -= low_bit(i)) { for (int j = pos_y; j > 0; j -= low_bit(j)) { sum += tree[i][j]; } } return sum;}int main () { int n; cin >> n; while (n--) { char ch[2]; cin >> ch; if (ch[0] == 'B') { int a, b; cin >> a >> b; a++, b++; if (!flag[a][b]) { flag[a][b] = 1; update(a, b, 1); } } else if (ch[0] == 'Q') { int x1, x2, y1, y2; cin >> x1 >> x2 >> y1 >> y2; x1++, x2++, y1++, y2++; if (x1 > x2) swap(x1, x2); if (y1 > y2) swap(y1, y2); cout << sum(x2, y2) - sum(x1 - 1, y2) - sum(x2, y1 - 1) + sum(x1 - 1, y1 -1) << endl; } else { int a, b; cin >> a >> b; a++, b++; if (flag[a][b]) { flag[a][b] = 0; update(a, b, -1); } } }}
阅读全文
1 0
- HDU 2642 Stars(二维树状数组 模板题)
- hdu 2642 Stars(二维树状数组)
- hdu 2642 Stars(二维树状数组)
- hdu 2642stars(二维树状数组)
- HDU 2642 stars 二维树状数组
- hdu 2642 stars (二维树状数组)
- HDU 2642 Stars (二维树状数组)
- HDU 2642 Stars(二维树状数组)
- hdu- 2642 Stars 二维树状数组
- HDU 2642 Stars 二维树状数组应用
- HDU 2642 Stars 二维树状数组
- HDU 2642 Stars [二维树状数组]【数据结构】
- hdu 2642 Stars (二维树状数组)
- hdu 2642 Stars 二维树状数组水题
- HDU-2642-Stars(二维树状数组应用)
- hdu 1541 Stars 树状数组模板题
- HDU 2642 Stars 简单二维树状数组应用
- hdu 2642 Stars--二维树状数组的应用
- C++删除string最后一个字符的几种方法
- Linux中的文件描述符与打开文件之间的关系
- 文章标题
- (六)TensorFlow学习之旅——深入理解AlexNet
- 信号灯的应用
- HDU 2642 Stars(二维树状数组 模板题)
- Visual Studio VS 2017 应用程序打包
- 4_代理模式
- hdu 1102 Constructing Roads
- Go语言学习之TCP RPC
- Codeforces 240F : TorCoder
- 知识点
- 对比groovy和java不同点。
- 学习笔记——JAVA设计模式<18>策略模式