随笔分类 -  计算几何

摘要：PipeTime Limit:1000MSMemory Limit:10000KTotal Submissions:8280Accepted:2483DescriptionThe GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of determining how far the light 阅读全文

摘要：An Easy Problem?!Time Limit:1000MSMemory Limit:65536KTotal Submissions:7837Accepted:1145DescriptionIt's raining outside. Farmer Johnson's bull Ben wants some rain to water his flowers. Ben nails two wooden boards on the wall of his barn. Shown in the pictures below, the two boards on the wal 阅读全文

摘要：Space AntTime Limit:1000MSMemory Limit:10000KTotal Submissions:2489Accepted:1567DescriptionThe most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye on the left side of it 阅读全文

摘要：IntersectionTime Limit:1000MSMemory Limit:10000KTotal Submissions:9996Accepted:2632DescriptionYou are to write a program that has to decide whether a given line segment intersects a given rectangle.An example:line: start point: (4,9)end point: (11,2)rectangle: left-top: (1,5)right-bottom: (7,1)Figur 阅读全文

摘要：Treasure HuntTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4797Accepted: 1998DescriptionArcheologists from the Antiquities and Curios Museum (ACM) have flown to Egypt to examine the great pyramid of Key-Ops. Using state-of-the-art technology they are able to determine that the lower floor 阅读全文

摘要：Pick-up sticksTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 7699Accepted: 2843DescriptionStan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no 阅读全文

摘要：The DoorsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5210Accepted: 2124DescriptionYou are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y = 0, and y = 10. The initial and final points of the p 阅读全文

摘要：Intersecting LinesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 8342Accepted: 3789DescriptionWe 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: 1) no intersection because they are parallel, 2) inter 阅读全文

摘要：SegmentsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7739Accepted: 2316DescriptionGiven n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at least one point in com 阅读全文

摘要：Toy StorageTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3146Accepted: 1798DescriptionMom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza is rebellious and o 阅读全文

摘要：TOYSTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 8661Accepted: 4114DescriptionCalculate 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 is finished playing with them. They gave John a rectan 阅读全文

摘要：打算转下来好好做计算几何了。原文地址：http://blog.sina.com.cn/s/blog_49c5866c0100f3om.html其实也谈不上推荐，只是自己做过的题目而已，甚至有的题目尚未AC，让在挣扎中。之所以推荐计算几何题，是因为，本人感觉ACM各种算法中计算几何算是比较实际的算法，在很多领域有着重要的用途计算几何题的特点与做题要领：1.大部分不会很难，少部分题目思路很巧妙2.做计算几何题目，模板很重要，模板必须高度可靠。3.要注意代码的组织，因为计算几何的题目很容易上两百行代码，里面大部分是模板。如果代码一片混乱，那么会严重影响做题正确率。4.注意精度控制。5.能用整数的地方 阅读全文

摘要：Stealing a CakeTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 80Accepted Submission(s): 15Problem DescriptionThere is a big round cake on the ground. A small ant plans to steal a small piece of cake. He starts from a certain point, reaches the cak 阅读全文

摘要：Building DesignTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 431Accepted Submission(s): 117Problem DescriptionYou are a notable architect.Recently, a company invites you to design their new building for them. It is not an easy task, because they 阅读全文

摘要：Shade of Hallelujah MountainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 483Accepted Submission(s): 93Problem DescriptionOn the planet Pandora, huge rocks are floating in the sky. Despite the beautiful scenery, these rocks bring some critical pr 阅读全文

摘要：Catching FishTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 943Accepted Submission(s): 335Problem DescriptionIgnatius likes catching fish very much. He has a fishnet whose shape is a circle of radius one. Now he is about to use his fishnet to cat 阅读全文

摘要：Hou Yi's secretTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 877Accepted Submission(s): 285Problem DescriptionLong long ago, in the time of Chinese emperor Yao, ten suns rose into the sky. They burned the crops and scorched the bushes and tre 阅读全文

摘要：AsteroidsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 297Accepted: 65Special JudgeDescriptionAssociation of Collision Management (ACM) is planning to perform the controlled collision of two asteroids. The asteroids will be slowly brought together and collided at negligible speed. ACM exp 阅读全文

摘要：Ultimate WeaponTime Limit: 2000MSMemory Limit: 131072KTotal Submissions: 1441Accepted: 713DescriptionIn year 2008 of the Cosmic Calendar, the Aliens send a huge armada towards the Earth seeking after conquest. The humans now depend on their ultimate weapon to retain their last hope of survival. The 阅读全文

摘要：3D Convex HullTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 592Accepted Submission(s): 328Problem DescriptionThere are N points in 3D-space which make up a 3D-Convex hull*. How many faces does the 3D-convexhull have? It is guaranteed that all the 阅读全文