当前搜索:

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...
阅读(712) 评论(0)

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...
阅读(970) 评论(0)

计算几何相关(更新中)

1.向量 结构体定义点和直线 struct point{ double x,y; }; struct line{ point a,b; };两点相减求向量,重载 - 运算符 struct point{ int x,y; point(){}; ...
阅读(340) 评论(0)

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...
阅读(366) 评论(0)

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

1007: [HNOI2008]水平可见直线 Time Limit: 1 Sec Memory Limit: 162 MB Submit: 7656 Solved: 2929 [Submit][Status][Discuss] Description   在xoy直角坐标平面上有n条直线L...
阅读(319) 评论(0)

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 bi...
阅读(420) 评论(0)

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 Submiss...
阅读(365) 评论(0)
    个人资料
    专栏达人 持之以恒
    等级:
    访问量: 6万+
    积分: 2253
    排名: 2万+
    联系方式
    欢迎谈论交流:1245985209
    博客专栏