City Horizon

最新推荐文章于 2023-05-20 19:10:00 发布

zichuan123456

最新推荐文章于 2023-05-20 19:10:00 发布

阅读量281

点赞数

CC 4.0 BY-SA版权

分类专栏：覆盖文章标签： integer input output sun bi

本文链接：https://blog.youkuaiyun.com/zichuan123456/article/details/7242181

覆盖专栏收录该内容

3 篇文章

订阅专栏

Description

Farmer John has taken his cows on a trip to the city! As the sun sets, the cows gaze at the city horizon and observe the beautiful silhouettes formed by the rectangular buildings.

The entire horizon is represented by a number line with N (1 ≤ N ≤ 40,000) buildings. Building i's silhouette has a base that spans locations A_i through B_i along the horizon (1 ≤ A_i < B_i ≤ 1,000,000,000) and has height H_i (1 ≤ H_i ≤ 1,000,000,000). Determine the area, in square units, of the aggregate silhouette formed by all N buildings.

Input

Line 1: A single integer: N
Lines 2..N+1: Input line i+1 describes building i with three space-separated integers: A_i, B_i, and H_i

Output

Line 1: The total area, in square units, of the silhouettes formed by all N buildings

Sample Input

Sample Output

YYYYYYYYYYYYYYYYYYYYYYYYYY
注意各种__int64;

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int m;
struct node
{
	__int64 x,y,z,ans;
}g[40005];
__int64 cmp(node a,node b)
{
	if(a.z!=b.z)
	return a.z<b.z;
	if(a.y!=b.y)
	return a.y>b.y;
	if(a.x!=b.x)
	return a.x<b.x;
}

void cover(__int64 l,__int64 r,int h,int k)
{
	while(h<m&&(l>=g[h].y||r<=g[h].x))
    	h++;
	if(h>=m||r<=l)
	{
		g[k].ans+=r-l;//当连续的一段被分成2部分是必须加一起；wa了n次；
		return;
	}
	if(l>=g[h].x&&r<=g[h].y)
    	return;
	if(l<g[h].x)
	{
		cover(l,g[h].x,h+1,k);
	}
	if(r>g[h].y)
    	cover(g[h].y,r,h+1,k);
}

int main()
{
	int i,j,k,n;
	while(scanf("%d",&m)!=EOF)
	{
	memset(g,0,sizeof(g));
	for(i=0;i<m;i++)
	{
		scanf("%I64d%I64d%I64d",&g[i].x,&g[i].y,&g[i].z);
	}
	//printf("\n\n");
	sort(g,g+m,cmp);
	for(i=m-1;i>=0;i--)
    	cover(g[i].x,g[i].y,i+1,i);
	__int64 sum=0;
	/*for(i=0;i<m;i++)
	printf("%I64d %I64d %I64d\n",g[i].x,g[i].y,g[i].z);*/
	/*for(i=0;i<m;i++)
    	printf("%d \n",g[i].ans);*/
	for(i=0;i<m;i++)
	{
		if(g[i].ans)
		sum+=g[i].ans*g[i].z;
	}
	printf("%I64d\n",sum);}
	return 0;
}