Ever_glow的博客

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

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

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,

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

TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16287 Accepted: 7821DescriptionCalculate 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

1007: [HNOI2008]水平可见直线Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 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是被覆

Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16736 Accepted: 7213DescriptionWe 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:

Polyline Simplification时间限制: 5 Sec  内存限制: 128 MB提交: 35  解决: 11[提交][状态][讨论版][命题人:admin]题目描述Mapping applications often represent the boundaries of countries, cities, etc. as polylines, whi