
计算几何
文章平均质量分 79
AnICoo1
这个作者很懒,什么都没留下…
展开
-
POJ 1066 Treasure Hunt (判断线段相交个数)
Treasure HuntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6138 Accepted: 2548DescriptionArcheologists from the Antiquities and Curios Museum (ACM) have原创 2015-12-11 21:09:09 · 492 阅读 · 0 评论 -
POJ 2653 Pick-up sticks (判断线段相交)
Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 11329 Accepted: 4247DescriptionStan has n sticks of various length. He throws them one at a原创 2015-11-04 21:11:34 · 1288 阅读 · 0 评论 -
HDOJ 5533 Dancing Stars on Me (判断点是否能组成正多边形)
Dancing Stars on MeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 105 Accepted Submission(s): 74Problem DescriptionThe sky was原创 2015-11-02 12:57:25 · 1001 阅读 · 0 评论 -
POJ 1408 Fishnet (判断围成四边形最大面积,直线相交问题)
FishnetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1935 Accepted: 1242DescriptionA fisherman named Etadokah awoke in a very small island. He could see原创 2015-11-19 22:03:11 · 582 阅读 · 0 评论 -
NYOJ 3 多边形重心问题 (求多面性重心及面积)
多边形重心问题时间限制:3000 ms | 内存限制:65535 KB难度:5描述 在某个多边形上,取n个点,这n个点顺序给出,按照给出顺序将相邻的点用直线连接, (第一个和最后一个连接),所有线段不和其他线段相交,但是可以重合,可得到一个多边形或一条线段或一个多边形和一个线段的连接后的图形;如果是一条线段,我们定义面积为0,重心坐标为(0,0).现在求给出的点集组成的原创 2015-12-04 22:28:06 · 414 阅读 · 0 评论 -
HDOJ 1086 You can Solve a Geometry Problem too (判断直线交点个数)
You can Solve a Geometry Problem tooTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9206 Accepted Submission(s): 4509Problem Descri原创 2015-12-05 22:27:00 · 311 阅读 · 0 评论 -
POJ 2318 TOYS (判断点与直线关系+二分查找)
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12533 Accepted: 6066DescriptionCalculate the number of toys that land in each bin of a partitioned toy原创 2015-12-07 21:10:16 · 375 阅读 · 0 评论 -
POJ 2398 Toy Storage (判断点与直线关系+排序二分计数)
Toy StorageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4851 Accepted: 2878DescriptionMom and dad have a problem: their child, Reza, never puts his toy原创 2015-12-07 21:27:46 · 304 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2) D. Polyline (点之间关系)
D. Polylinetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are three points marked on the coordinate plane. The原创 2016-01-30 10:34:38 · 539 阅读 · 0 评论 -
POJ 1005 I Think I Need a Houseboat (简单几何)
I Think I Need a HouseboatTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 95428 Accepted: 41554DescriptionFred Mapper is considering purchasing some land原创 2016-02-12 20:44:30 · 439 阅读 · 0 评论 -
POJ 1696 Space Ant (卷包裹法求变形凸包)
Space AntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3816 Accepted: 2386DescriptionThe most exciting space discovery occurred at the end of the 20th c原创 2016-01-14 20:58:33 · 465 阅读 · 0 评论 -
Codeforces Round #331 (Div. 2) A. Wilbur and Swimming Pool (判断组成最大矩形)
A. Wilbur and Swimming Pooltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter making bad dives into swimming pools原创 2016-03-16 08:43:40 · 414 阅读 · 0 评论 -
Lightoj 1062 Crossed Ladders (二分)
题目链接:http://www.lightoj.com/volume_showproblem.php?problem=1062题意:两根棍子斜放在墙上,给你棍子的长度和他们交点距离地面的高度 ,求两个墙之间的距离 思路:直接枚举距离二分即可 ac代码:#include<stdio.h>#include<math.h>#include<string.h>#include<stack>#i原创 2016-05-10 17:39:06 · 838 阅读 · 0 评论 -
LightOJ 1385 Kingdom Division (几何推导)
题目链接:http://www.lightoj.com/volume_showproblem.php?problem=1385题意:给你一个分成了四部分的三角形,已知a,b,c,求d是否存在思路:链接EF,设XEF为s1,AEF为x2,根据题目我们可以求得两个等式:s1/A=C/B,(A+s1+s2)/(B+C)=s2/(s1+C),化简求即可ac代码:#include<stdio.h>#incl原创 2016-05-10 17:45:59 · 437 阅读 · 0 评论 -
Codeforces Round #100 A. New Year Table (几何精度)
题目链接:http://codeforces.com/problemset/problem/140/A题意:给你一个大圆半径R,一个小圆半径r,问是否能在R中放置n个小圆,小圆必须贴着大圆的边思路:求出r在R中最多能放多少个,注意特判,向下取整过程中需要加精度ac代码:#include<stdio.h>#include<math.h>#include<string.h>#include<sta原创 2016-05-13 18:20:33 · 542 阅读 · 0 评论 -
hdu5733 tetrahedron (求四面体内切球球心+点面距)
tetrahedron Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 569 Accepted Submission(s): 219Problem Description Given four points ABCD, if原创 2016-07-20 21:01:32 · 2666 阅读 · 3 评论 -
NYOJ 1132 promise me a medal (判断两线段是否相交)
promise me a medal时间限制:1000 ms | 内存限制:65535 KB难度:2描述 you all know that creat2012 will go to a regional. and i want you all pray for us. thx. for this problem, you need judge if two se原创 2015-11-27 18:37:19 · 462 阅读 · 0 评论 -
HDOJ 5538 House Building (二维坐标求表面积)
House BuildingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 96 Accepted Submission(s): 77Problem DescriptionHave you ever pla原创 2015-11-02 13:59:22 · 601 阅读 · 0 评论 -
NYOJ 952 最大四边形 (n个点求组成四边形的最大面积)
最大四边形时间限制:1000 ms | 内存限制:65535 KB难度:2描述 平面坐标上有n个点,你知道能组成四边形中面积最大的是多少吗?输入有多组测试数据第一行整数n,表示有n个点,( 4然后n行,每行x,y表示点的坐标。(没有重复的点)输出最大四边形的面积.(保留六位小数)样例输入50 00 44 04 42 3样例输出16.000000原创 2015-11-24 15:29:40 · 1892 阅读 · 0 评论 -
HDOJ 2108 Shape of HDU (判断凹凸多边形)
Shape of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6850 Accepted Submission(s): 3087Problem Description话说上回讲到海东集团推选老总的事情原创 2015-12-11 21:59:03 · 568 阅读 · 0 评论 -
POJ 3348 Cows (凸包+求面积)
CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7869 Accepted: 3565DescriptionYour friend to the south is interested in building fences and turning原创 2015-12-12 14:25:03 · 534 阅读 · 0 评论 -
POJ 3737 UmBasketella (求最大体积圆锥)
UmBasketellaTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6491 Accepted: 2525DescriptionIn recent days, people always design new things with multifu原创 2015-12-11 22:39:21 · 492 阅读 · 0 评论 -
POJ 1556 The Doors (判断线段相交+dijkstra)
The DoorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7392 Accepted: 2900DescriptionYou are to find the length of the shortest path through a chamber c原创 2015-12-12 16:26:36 · 512 阅读 · 0 评论 -
POJ 1228 Grandpa's Estate (稳定凸包的判定)
Grandpa's EstateTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11990 Accepted: 3340DescriptionBeing the only living descendant of his grandfather, Kamran原创 2015-12-12 22:28:19 · 629 阅读 · 0 评论 -
POJ 3335 Rotating Scoreboard (半平面交判断)
Rotating ScoreboardTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6190 Accepted: 2447DescriptionThis year, ACM/ICPC World finals will be held in a hall原创 2015-12-13 22:30:55 · 464 阅读 · 0 评论 -
POJ 1474 Video Surveillance (半平面交判断)
Video SurveillanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3612 Accepted: 1617DescriptionA friend of yours has taken the job of security officer at原创 2015-12-14 22:19:16 · 442 阅读 · 0 评论 -
UESTC 1265 宝贵资源 (求最小正方形面积)
题目链接:http://acm.uestc.edu.cn/#/problem/show/1265思路:因为城市是正方形,所以说取x轴的最大差值和y轴的最大差值的最大值,然后平方ac代码:#include#include#include#include#include#include#include#include#define MAXN 1010000原创 2016-01-17 22:22:41 · 594 阅读 · 0 评论 -
POJ 1279 Art Gallery (半平面交求面积)
Art GalleryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6318 Accepted: 2627DescriptionThe art galleries of the new and very futuristic building of the原创 2015-12-16 18:45:30 · 419 阅读 · 0 评论 -
HDOJ 2036 改革春风吹满地 (求N边形面积)
改革春风吹满地Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24595 Accepted Submission(s): 12697Problem Description“ 改革春风吹满地,不会AC没关系;原创 2015-11-24 16:52:53 · 379 阅读 · 0 评论 -
HDOJ 1115 Lifting the Stone (求多边形重心坐标)
Lifting the StoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6730 Accepted Submission(s): 2801Problem DescriptionThere are ma原创 2015-12-04 22:26:25 · 323 阅读 · 0 评论 -
HDOJ 5563 Clarke and five-pointed star (判断五个点组成的是否为正五角星)
Clarke and five-pointed starTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 420 Accepted Submission(s): 227Problem DescriptionCla原创 2015-11-17 16:31:46 · 1204 阅读 · 5 评论 -
POJ 1269 Intersecting Lines (判断直线是否相交)
Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12831 Accepted: 5697DescriptionWe all know that a pair of distinct points on a plane def原创 2015-10-27 22:57:37 · 451 阅读 · 0 评论 -
POJ 1410 Intersection(判断线段与矩形是否相交)
IntersectionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13106 Accepted: 3412DescriptionYou are to write a program that has to decide whether a given l原创 2015-10-25 11:33:19 · 573 阅读 · 1 评论 -
NYOJ 1099 Lan Xiang's Square (判断是否为正四边形)
Lan Xiang's Square时间限制:1000 ms | 内存限制:65535 KB难度:0描述 Excavator technology which is strong, fast to Shandong to find Lan Xiang. Then the question comes.. :) for thi原创 2015-11-27 18:50:49 · 617 阅读 · 0 评论 -
Codeforces Round #352 (Div. 2) C. Recycling Bottles (几何)
C. Recycling Bottlestime limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputIt was recycling day in Kekoland. To celebrate it Adil and Bera w原创 2016-08-24 20:44:22 · 358 阅读 · 0 评论