2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 F. Overlapping Rectangles （面积并+线段树）

There are nn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with each other, and the overlapped areas of these rectangles shall not be counted more than once. For example,...

ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 E Territorial Dispute （凸包）

Territorial Dispute 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 In 2333, the C++ Empire and the Java Republic become the most powerful country in the world. They compete with each other in the colonizing the Mars. There are n colonies on the Mars, numbered from...

计算几何相关（更新中）

1.向量 结构体定义点和直线 struct point{ double x,y; }; struct line{ point a,b; };两点相减求向量，重载 - 运算符 struct point{ int x,y; point(){}; //因为有带参的构造函数，下面无法直接定义，所以加一个无参的构造函数 point...

POJ 1269 Intersecting Lines

Intersecting Lines Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 16736 Accepted: 7213 Description We all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: ...

BZOJ 1007: [HNOI2008]水平可见直线

1007: [HNOI2008]水平可见直线 Time Limit: 1 Sec Memory Limit: 162 MB Submit: 7656 Solved: 2929 [Submit][Status][Discuss] Description 　　在xoy直角坐标平面上有n条直线L1,L2,...Ln,若在y值为正无穷大处往下看,能见到Li的某个子线段,则称Li为 可见的,否则Li为被覆盖的. 例如,对于直线: L1:y=x; L2:y=-x; L3:y=0 则L1和L2是可见的,L3是被覆...

POJ 2318 TOYS (向量叉乘+二分）

TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16287 Accepted: 7821 Description Calculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he...

HDU 5839 Special Tetrahedron（几何+暴力）

Special Tetrahedron Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 843 Accepted Submission(s): 348 Problem Description Given n points which are in three-dimensional space(without repetition)....

个人资料
• 访问：34559次
• 积分：1586
• 等级：
• 排名：千里之外
• 原创：127篇
• 转载：1篇
• 译文：0篇
• 评论：13条
联系方式
欢迎谈论交流：1245985209
博客专栏
 CodeForce题解 文章：26篇 阅读：8088
 ACM的进阶之路 文章：68篇 阅读：20864
文章分类
最新评论