随笔分类 -  几何

最小圆覆盖（随机增量||模拟退火）
摘要：最小圆覆盖 https://www.lydsy.com/JudgeOnline/problem.php?id=1337 Description 给出平面上N个点,N<=10^5.请求出一个半径最小的圆覆盖住所有的点 Input 第一行给出数字N，现在N行，每行两个实数x,y表示其坐标. Output 阅读全文

posted @ 2019-05-09 21:59 Fighting_sh 阅读(449) 评论(0) 推荐(0)

最小圆覆盖
摘要：最小圆覆盖 https://www.lydsy.com/JudgeOnline/problem.php?id=1337 Description 给出平面上N个点,N<=10^5.请求出一个半径最小的圆覆盖住所有的点 Input 第一行给出数字N，现在N行，每行两个实数x,y表示其坐标. Output 阅读全文

posted @ 2019-05-09 21:58 Fighting_sh 阅读(264) 评论(0) 推荐(0)

Beauty Contest(旋转卡壳模版题)
摘要：Beauty Contest http://poj.org/problem?id=2187 Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 44329 Accepted: 13668 Description Bessie, Far 阅读全文

posted @ 2019-05-07 11:14 Fighting_sh 阅读(361) 评论(0) 推荐(0)

Feng Shui
摘要：Feng Shui http://poj.org/problem?id=3384 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6627 Accepted: 1972 Special Judge Description Feng 阅读全文

posted @ 2019-05-05 21:56 Fighting_sh 阅读(483) 评论(0) 推荐(0)

Most Distant Point from the Sea
摘要：Most Distant Point from the Sea http://poj.org/problem?id=3525 Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 6214 Accepted: 2745 Special 阅读全文

posted @ 2019-05-05 21:34 Fighting_sh 阅读(238) 评论(0) 推荐(0)

Art Gallery
摘要：Art Gallery http://poj.org/problem?id=1279 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9684 Accepted: 3747 Description The art gallerie 阅读全文

posted @ 2019-05-05 18:27 Fighting_sh 阅读(594) 评论(0) 推荐(0)

Rotating Scoreboard（半平面交模板题）
摘要：Rotating Scoreboard http://poj.org/problem?id=3335 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8506 Accepted: 3357 Description This yea 阅读全文

posted @ 2019-05-03 13:01 Fighting_sh 阅读(336) 评论(0) 推荐(0)

Harry Potter and J.K.Rowling(半平面交+圆和矩形交)
摘要：Harry Potter and J.K.Rowling http://acm.hdu.edu.cn/showproblem.php?pid=3982 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/O 阅读全文

posted @ 2019-04-27 22:53 Fighting_sh 阅读(312) 评论(0) 推荐(0)

Country Meow
摘要：Country Meow 和这基本一样 https://www.cnblogs.com/Fighting-sh/p/9809518.html 1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<cmath> 5 阅读全文

posted @ 2018-11-22 21:52 Fighting_sh 阅读(246) 评论(0) 推荐(0)

Space Ant（极角排序）
摘要：Space Ant http://poj.org/problem?id=1696 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5371 Accepted: 3343 Description The most exciting 阅读全文

posted @ 2018-11-14 21:57 Fighting_sh 阅读(527) 评论(0) 推荐(0)

Treasure Hunt
摘要：Treasure Hunt http://poj.org/problem?id=1066 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8233 Accepted: 3402 Description Archeologists 阅读全文

posted @ 2018-11-08 11:27 Fighting_sh 阅读(477) 评论(0) 推荐(0)

The Doors(几何+最短路，好题)
摘要：The Doors http://poj.org/problem?id=1556 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10466 Accepted: 3891 Description You are to find t 阅读全文

posted @ 2018-11-08 10:30 Fighting_sh 阅读(273) 评论(0) 推荐(0)

Intersection（Check）
摘要：Intersection http://poj.org/problem?id=1410 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17591 Accepted: 4516 Description You are to wri 阅读全文

posted @ 2018-11-07 15:14 Fighting_sh 阅读(303) 评论(0) 推荐(0)

Pick-up sticks
摘要：Pick-up sticks http://poj.org/problem?id=2653 Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 15265 Accepted: 5752 Description Stan has n s 阅读全文

posted @ 2018-11-06 21:52 Fighting_sh 阅读(351) 评论(0) 推荐(0)

Inside Triangle
摘要：Inside Triangle https://hihocoder.com/contest/hiho225/problem/1 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 Determine i 阅读全文

posted @ 2018-10-26 15:02 Fighting_sh 阅读(239) 评论(0) 推荐(0)

Intersecting Lines(叉积，方程)
摘要：Intersecting Lines http://poj.org/problem?id=1269 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 18897 Accepted: 8043 Description We all k 阅读全文

posted @ 2018-10-18 20:24 Fighting_sh 阅读(274) 评论(0) 推荐(0)

Segments(叉积)
摘要：Segments http://poj.org/problem?id=3304 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18066 Accepted: 5680 Description Given n segments i 阅读全文

posted @ 2018-10-18 14:47 Fighting_sh 阅读(469) 评论(0) 推荐(0)

Super Star(最小球覆盖)
摘要：Super Star http://poj.org/problem?id=2069 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6486 Accepted: 1603 Special Judge Description Dur 阅读全文

posted @ 2018-10-18 11:32 Fighting_sh 阅读(924) 评论(0) 推荐(0)

TOYS（叉积）
摘要：TOYS http://poj.org/problem?id=2318 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19301 Accepted: 9106 Description Calculate the number o 阅读全文

posted @ 2018-10-17 14:59 Fighting_sh 阅读(378) 评论(0) 推荐(0)

导航