![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
计算几何
shiyuankongbu
这个作者很懒,什么都没留下…
展开
-
hdu 1086 You can Solve a Geometry Problem too
You can Solve a Geometry Problem too Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4659 Accepted Submission(s): 2236 Proble原创 2012-12-08 13:17:31 · 964 阅读 · 0 评论 -
CF 2 C. Commentator problem
题目:Commentator problem 思路:从重心开始向周围探测,看喵呜大神的代码过的 #include #include #include #include #include using namespace std; #define eps 1e-6 int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}}; struct circle {原创 2013-07-13 10:18:12 · 1453 阅读 · 0 评论 -
hdu 1007 Quoit Design
Quoit Design Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18291 Accepted Submission(s): 4713 Problem Description Have you ev原创 2012-12-08 11:49:06 · 1361 阅读 · 0 评论 -
poj 3304 Segments
题目:Segments // 题目求是否满足所有给定的线段在一条直线上有一个公共的投影点 // 对于某一条直线而言,过这个点有一条垂线,那么所有的线段必定与垂线有交点 // 当这条垂线还没有确定的时候,我们可以通过一条一条线段确定垂线旋转的范围 // 而这些范围的极限就是某条或者某两条线段的端点 // 因此我们要做的是枚举线段的端点看是否存在一条直线与所有线段均相交 #include #inc原创 2013-02-14 22:08:51 · 564 阅读 · 0 评论 -
poj 2318 TOYS
题目:TOYS //根据叉积判断toy恰好仅在某个隔板的右侧 //比较简单,隔板都是排好序的,所以只需要依次比较 #include #include #include #include using namespace std; struct point { double x,y; }; double xmulti(point p1,point p2,point p0) {原创 2013-02-14 19:16:17 · 419 阅读 · 0 评论 -
poj 2398 Toy Storage
题目:Toy Storage // poj2318 的变形 // 需要自己给隔板排序 #include #include #include #include using namespace std; struct point { double x,y; }; struct line { point sp,ep; }; line l[5005]; double xmulti原创 2013-02-14 19:17:58 · 413 阅读 · 0 评论 -
poj 1269 Intersecting Lines
题目:Intersecting Lines // 求交点 // G++交 return WA // C++交 return AC #include #include #include #include using namespace std; #define eps 1e-8 struct point { double x,y; }; struct line { poin原创 2013-02-14 19:19:39 · 442 阅读 · 0 评论 -
poj 1106 Transmitters
Language: Default Transmitters Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3812 Accepted: 2034 Description In a wireless network with multiple tr原创 2012-12-12 08:12:00 · 776 阅读 · 0 评论 -
poj 2187 Beauty Contest
Language: Default Beauty Contest Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 22188 Accepted: 6788 Description Bessie, Farmer John's prize cow, ha原创 2012-12-09 12:20:04 · 515 阅读 · 0 评论 -
poj 1113 Wall
Wall Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 24123 Accepted: 8017 Description Once upon a time there was a greedy King who ordered his chief Arch原创 2012-12-08 14:49:34 · 1356 阅读 · 0 评论