计算几何
junior19
abcde
展开
-
NYOJ1016:德莱联盟(判线段相交)
德莱联盟时间限制:1000 ms | 内存限制:65535 KB难度:1描述欢迎来到德莱联盟。。。。德莱文。。。德莱文在逃跑,卡兹克在追。。。。我们知道德莱文的起点和终点坐标,我们也知道卡兹克的起点和中点坐标,问:卡兹克有可能和德莱文相遇吗?,并且保证他们走的都是直线。输入几组数据,一个整数T表示T组数据每组数据 8个实数,分转载 2016-12-23 15:31:27 · 365 阅读 · 0 评论 -
BZOJ1069:最大土地面积(旋转卡壳 & 四边形面积)
1069: [SCOI2007]最大土地面积Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 3720 Solved: 1471[Submit][Status][Discuss]Description 在某块平面土地上有N个点,你可以选择其中的任意四个点,将这片土地围起来,当然,你希望这四个点围成的多边形面积最大。原创 2017-12-05 19:39:24 · 273 阅读 · 0 评论 -
CFgym:Glyph Recognition(计算几何)
▶ Given some points in the plane, and 3 ≤ k ≤ 8, find two regular k-gons containing all the points between them.▶ Each polygon is centered at the origin, i.e. all vertices have equal distance to (0原创 2017-12-01 21:33:07 · 365 阅读 · 0 评论 -
POJ2187:Beauty Contest(凸包 & 旋转卡壳)
Beauty ContestTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 39350 Accepted: 12212DescriptionBessie, Farmer John's prize cow, has just won first plac原创 2017-12-01 19:23:18 · 224 阅读 · 0 评论 -
POJ1113:Wall(凸包)
WallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 38309 Accepted: 13077DescriptionOnce upon a time there was a greedy King who ordered his chief Arc原创 2017-09-15 17:34:59 · 296 阅读 · 0 评论 -
UVALive6955:Finding Lines(直线过点 & 随机算法)
题意:给N个点,和数字p,问是否至少有p%个点在同一条直线上。思路:循环280次枚举任意两个点,O(n)验证这两个点是否在线上,因为若这条直线存在,最坏情况选错的概率仅为(1-p*p)^280 = 0.96^280。# include # include # include # include using namespace std;typedef long long LL;c原创 2017-09-30 11:07:01 · 322 阅读 · 0 评论 -
CF820B:Mister B and Angle in Polygon(数学 & 几何)
B. Mister B and Angle in Polygontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOn one quiet day all of su原创 2017-07-08 22:16:16 · 339 阅读 · 0 评论 -
HDU5120:Intersection(圆环相交)
IntersectionTime Limit: 4000/4000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3071 Accepted Submission(s): 1154Problem DescriptionMatt is a b原创 2017-05-20 15:51:53 · 392 阅读 · 0 评论 -
HDU1147:Pick-up sticks(线段相交)
Pick-up sticksTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3114 Accepted Submission(s): 1170Problem DescriptionStan has n原创 2017-04-12 23:16:39 · 362 阅读 · 0 评论 -
FZU2273:Triangles(计算几何 & 两三角形的位置)
This is a simple problem. Given two triangles A and B, you should determine they are intersect, contain or disjoint. (Public edge or point are treated as intersect.)InputFirst line contains an integer...原创 2018-03-13 16:47:31 · 592 阅读 · 0 评论