线段树|POJ训练计划1177_Picture(扫描线/线段树+离散)
解题报告
题意：
求矩形周长和。
思路：
左扫上扫，扫过了。
#include
#include
#include
#include
#include
using namespace std;
struct Seg {
int lx,rx,ly,ry,h,v;
friend bool operator < (Seg a,Seg b)
{
return a.hr||qr>1;
update1(rt<<1,l,mid,ql,qr,v);
update1(rt<<1|1,mid+1,r,ql,qr,v);
push_up1(rt,l,r);
}
void push_up2(int rt,int l,int r)
{
if(lz[rt]) {
sum[rt]=_hy[r+1]-_hy[l];
} else sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void update2(int rt,int l,int r,int ql,int qr,int v)
{
if(ql>r||qr>1;
update2(rt<<1,l,mid,ql,qr,v);
update2(rt<<1|1,mid+1,r,ql,qr,v);
push_up2(rt,l,r);
}
int main()
{
int lx,rx,ly,ry,n,i,j;
scanf("%d",&n);
for(i=0;
i Picture
| Time Limit: 2000MS | Memory Limit: 10000K | |
| Total Submissions: 10332 | Accepted: 5485 |
Description
A number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. Each rectangle can be partially or totally covered by the others. The length of the boundary of the union of all rectangles is called the perimeter.
Write a program to calculate the perimeter. An example with 7 rectangles is shown in Figure 1.
文章图片
The corresponding boundary is the whole set of line segments drawn in Figure 2.
文章图片
The vertices of all rectangles have integer coordinates.
Input
Your program is to read from standard input. The first line contains the number of rectangles pasted on the wall. In each of the subsequent lines, one can find the integer coordinates of the lower left vertex and the upper right vertex of each rectangle. The values of those coordinates are given as ordered pairs consisting of an x-coordinate followed by a y-coordinate.
0 <= number of rectangles < 5000
All coordinates are in the range [-10000,10000] and any existing rectangle has a positive area. Output
Your program is to write to standard output. The output must contain a single line with a non-negative integer which corresponds to the perimeter for the input rectangles. Sample Input
7 -15 0 5 10 -5 8 20 25 15 -4 24 14 0 -6 16 4 2 15 10 22 30 10 36 20 34 0 40 16
Sample Output
228
【线段树|POJ训练计划1177_Picture(扫描线/线段树+离散)】Source
IOI 1998
推荐阅读
- 【生信技能树】R语言练习题|【生信技能树】R语言练习题 - 中级
- java中如何实现重建二叉树
- 种树郭橐驼传（文言句式+古今异义+词类活用+通假字）
- 白杨树
- 08黑龙江迟淑荣弯柳树网络学院第五期学习赵宗瑞老师主讲的（传统文化与身心健康）教育体系心得体会
- ［原创］能见沂山一棵树，胜读十年无用书！
- 涵养字外功
- 2018.07.07《刺杀骑士团长》村上春树
- 二叉树路径节点关键值和等于目标值（LeetCode--112&LeetCode--113）
- 撒哈拉沙漠-三毛