hdu 2642 Stars

原创 2015年11月19日 21:33:00
Problem 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.


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.


Output
For each query,output the number of bright stars in one line.


Sample Input
5
B 581 145
B 581 145
Q 0 600 0 200
D 581 145
Q 0 600 0 200


Sample Output
1

0

二维树状数组

代码:

#include <iostream>
#include <algorithm>
#include <cstring> 
using namespace std;
int a[1005][1005],c[1005][1005];
int lowbit(int x)
{
	return x&(-x);
}
int Sum(int i,int j)
{   int sum=0,k,p;
	for(k=i;k>0;k=k-lowbit(k))
	  for(p=j;p>0;p=p-lowbit(p))
	    sum+=c[k][p];
	return sum;
}
void change(int i,int j,int x)
{       int k,p;
		for(k=i;k<=1004;k=k+lowbit(k))
	      for(p=j;p<=1004;p=p+lowbit(p))
	          c[k][p]+=x;
}
int main()
{
	int i,j,k,n,m,x,y;
	char ch;
	    while(cin>>n)
	    {
	     m=n;
		 memset(a,0,sizeof(a));
		 memset(c,0,sizeof(c));
		 while(n--)
		  {
			cin>>ch;
			if(ch=='B'||ch=='D')
			{
				cin>>x>>y;
				x++;y++;
				if(ch=='B'&&a[x][y]==0)
				    {
					  change(x,y,1); 
					  a[x][y]=1;
				    }
			    
                if(ch=='D'&&a[x][y]==1)
                    { 
					  change(x,y,-1);
					  a[x][y]=0;
                    }
		    }
            else 
		    {	int x1,x2,y1,y2;
		        cin>>x1>>x2>>y1>>y2;
				if(x1>x2)
			        swap(x1,x2);
			
				if(y1>y2)
					swap(y1,y2);
				cout<<Sum(x2+1,y2+1)+Sum(x1,y1)-Sum(x1,y2+1)-Sum(x2+1,y1)<<endl;
		    }
		   
		  } 
	    }
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU2642 Stars【二维树状数组】

题目大意: 现在假设天空是一个二维平面(1000*1000)。坐标从(0,0)点开始。现在给出N条信息。 "B X Y",B为字符,x、y是整数,表示将坐标(x,y)的星星变亮。 "D XY",D为字...

HDU 2642 Stars 二维树状数组

Stars Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others) ...

HDU 2642 stars 二维树状数组

Stars Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/65536 K (Java/Others) Total Su...

hdu 2642 stars (二维树状数组)

挺水的题,但是觉得有点不科学,要加个数组标记下是否出现过,没点亮过得星星也能熄灭么。WA了一回. 基本还是和上一题差不多的。 /* Problem ID: meaning: Analyzing: ...
  • cqlf__
  • cqlf__
  • 2012年09月18日 16:22
  • 344

HDU 2642 Stars(二维树状数组 模板题)

Stars Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others) ...

hdu 2642 Stars(二维树状数组)

Stars Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/65536 K (Java/Others) Total Su...
  • WEYuLi
  • WEYuLi
  • 2013年11月14日 11:06
  • 501

HDU 2642 Stars 二维树状数组应用

Stars Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/65536 K (Java/Others) Total Su...

【树状数组(二维)】poj 1195 Mobile phones(外:hdu 2642 Stars)

http://poj.org/problem?id=1195 分析:裸二维树状数组 #include #include #include using namespace std; cons...
  • yduqytd
  • yduqytd
  • 2014年01月27日 23:10
  • 392

hdu_2642 Stars 线段树+点修改

Stars Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/65536 K (Java/Others) Total Su...

HDU-2642-Stars(二维树状数组应用)

Stars Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/65536 K (Java/Others) Total Subm...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu 2642 Stars
举报原因:
原因补充:

(最多只允许输入30个字)