https://111qqz.com/en/tags/%E8%AE%A1%E7%AE%97%E5%87%A0%E4%BD%95/Recent content in 计算几何 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzThu, 12 Oct 2017 04:47:03 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-12-spoj-cirut/Thu, 12 Oct 2017 04:47:03 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-12-spoj-cirut/<p><a href="http://www.spoj.com/problems/CIRUT/" target="_blank" rel="noreferrer">题目链接</a></p> <h1 class="relative group">题意&amp;思路： <div id="题意思路" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f%e6%80%9d%e8%b7%af" aria-label="Anchor">#</a> </span> </h1> <p>给出n个圆</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-11-spoj-ciru/Wed, 11 Oct 2017 12:36:52 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-11-spoj-ciru/<p><a href="http://www.spoj.com/problems/CIRU/en/" target="_blank" rel="noreferrer">题目链接</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>多n个圆的面积并。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-09-hdu1724/Mon, 09 Oct 2017 13:33:36 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-09-hdu1724/<p><a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=1724" target="_blank" rel="noreferrer">hdu1724题目链接</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p><figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://acm.split.hdu.edu.cn/data/images/C61-1005-1.JPG" ></figure> 求图示区域的面积。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-09-simpsons-rule-notes/Mon, 09 Oct 2017 13:10:43 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-09-simpsons-rule-notes/<p>16沈阳的阴影还在orz，来学习一下辛普森积分。</p> <p>参考资料：<a href="https://wenku.baidu.com/view/10653ac38bd63186bcebbca3.html" target="_blank" rel="noreferrer">梯形多步法和辛普森积分</a></p> <p><a href="https://github.com/poluner/blog/blob/master/acm/computational-geometry/.md" target="_blank" rel="noreferrer">辛普森计算定积分</a></p> <p>辛普森积分是一种数值积分方法（然后现在只记得教计算方法的是一个小姐姐，并不记得当时学了什么orz</p>https://111qqz.com/en/post/acm-icpc/2016/2016-08-31-bzoj-3680-e5908ae68993xxx-e5b9bfe4b989e8b4b9e9a9ace782b9efbc8ce6a8a1e68b9fe98080e781abe788ace5b1b1/Wed, 31 Aug 2016 13:32:02 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-31-bzoj-3680-e5908ae68993xxx-e5b9bfe4b989e8b4b9e9a9ace782b9efbc8ce6a8a1e68b9fe98080e781abe788ace5b1b1/<h2 class="relative group">3680: 吊打XXX <div id="3680-吊打xxx" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#3680-%e5%90%8a%e6%89%93xxx" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 10 Sec  Memory Limit: 128 MBSec  Special Judge Submit: 2043  Solved: 732 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=3680" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=3680" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=3680" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-08-31-hdu-5017-ellipsoid-e6a8a1e68b9fe98080e781abefbc8ce8aea1e7ae97e6a4ade79083e588b0e5ae9ae782b9e79a84e69c80e5b08fe8b79de7a6bb/Wed, 31 Aug 2016 06:51:29 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-31-hdu-5017-ellipsoid-e6a8a1e68b9fe98080e781abefbc8ce8aea1e7ae97e6a4ade79083e588b0e5ae9ae782b9e79a84e69c80e5b08fe8b79de7a6bb/<p><a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5017" target="_blank" rel="noreferrer">hdu 5017 题目链接</a></p> <p>题意：给出椭球方程的6的参数 a,b,c,d,e,f <figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://acm.split.hdu.edu.cn/data/images/C534-1011-1.jpg" ></figure> </p> <p>问椭球上的点到原点(0,0,,0)的最小距离是多少。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-08-29-poj-1385/Mon, 29 Aug 2016 03:31:15 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-29-poj-1385/<p><a href="http://poj.org/problem?id=1385" target="_blank" rel="noreferrer">poj 1385 题目链接</a></p> <p>题意：求多边形的重心。</p> <p>思路：</p> <p>抄模板（逃</p> <p>嘛。。三角形的重心是三个点坐标的平均数。。。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-08-28-poj-1380/Sun, 28 Aug 2016 13:03:22 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-28-poj-1380/<p><a href="http://poj.org/problem?id=1380" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：问一个小矩形能否放在一个大矩形中，给定两个矩形的尺寸。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-04-15-bzoj-1656/Fri, 15 Apr 2016 07:23:53 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-04-15-bzoj-1656/<h2 class="relative group">1656: [Usaco2006 Jan] The Grove 树木 <div id="1656-usaco2006-jan-the-grove-树木" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#1656-usaco2006-jan-the-grove-%e6%a0%91%e6%9c%a8" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 5 Sec  Memory Limit: 64 MB Submit: 143  Solved: 88 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1656" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1656" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1656" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-03-31-codeforces-346-div-2-d-bicycle-race-e6809de7bbb4efbc8ce8aea1e7ae97e587a0e4bd95efbc8ce585ace5bc8f/Thu, 31 Mar 2016 09:02:23 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-03-31-codeforces-346-div-2-d-bicycle-race-e6809de7bbb4efbc8ce8aea1e7ae97e587a0e4bd95efbc8ce585ace5bc8f/<p><a href="http://codeforces.com/contest/659/problem/D" target="_blank" rel="noreferrer">题目链接</a> 题意：给出n+1个点，每次由i点到i+1点，每段线段之间保证不同向或者反向，第一个点和最后一个点保证重合。路径围城的封闭图形中间都是水，问有多少个危险点，使得如果在这个点忘记转弯就会掉进水里。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-02-27-bzoj1610/Sat, 27 Feb 2016 18:35:59 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-02-27-bzoj1610/<p><a href="http://www.lydsy.com/JudgeOnline/problem.php?id=1610" target="_blank" rel="noreferrer">http://www.lydsy.com/JudgeOnline/problem.php?id=1610</a> 题意：给出n个点，问有多少条直线，这些之间之间都不平行。 思路：求斜率（注意考虑斜率不存在），看有多少种斜率。 <strong>妈蛋。。。。斜率不存在是横坐标相等啊，不是纵坐标啊。。。蠢哭了好么。。。。。。</strong></p>https://111qqz.com/en/post/acm-icpc/2016/2016-02-17-cf614c/Wed, 17 Feb 2016 15:54:12 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-02-17-cf614c/<h3 class="relative group"><a href="http://codeforces.com/contest/614/problem/C" target="_blank" rel="noreferrer">http://codeforces.com/contest/614/problem/C</a> <div id="" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#" aria-label="Anchor">#</a> </span> </h3> <p>题意：给一个多边形和多边形外一定点，多边形绕定点旋转，问多边形扫过的面积。 思路：简单计算几何，找到多边形距离定点的最大和最小距离R和r,答案就是(R^2-R^2)*PI <strong>需要注意的是：最大距离一定是从某点上取得，但是最小距离可能不在顶点上，而在某条边上。</strong></p>https://111qqz.com/en/post/acm-icpc/2015/2015-12-29-codeforces-14-c-four-segments/Tue, 29 Dec 2015 09:29:57 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-12-29-codeforces-14-c-four-segments/<p><a href="http://codeforces.com/problemset/problem/14/C" target="_blank" rel="noreferrer">http://codeforces.com/problemset/problem/14/C</a> 题意：给出四条边的坐标，问能否形成一个边与坐标轴平行的矩形。边可能退化成点。 思路：首先第一步，检查有没有边退化成点以及是否有不平行的边。</p>https://111qqz.com/en/post/acm-icpc/2015/2015-12-21-hdu-1221-rectangle-and-circle/Mon, 21 Dec 2015 13:59:05 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-12-21-hdu-1221-rectangle-and-circle/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=1221" target="_blank" rel="noreferrer">http://acm.hdu.edu.cn/showproblem.php?pid=1221</a> 题意：问圆和矩形是否相交 思路：主要特殊的包含情况，然后判断与线段相交。</p>https://111qqz.com/en/post/acm-icpc/2015/2015-08-16-codeforces560c-geraldshexagone6809de7bbb4efbc8ce587a0e4bd95/Sun, 16 Aug 2015 23:28:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-16-codeforces560c-geraldshexagone6809de7bbb4efbc8ce587a0e4bd95/<p>题意：给定一个六边形的六条边的长，问能分割成多少个单位正三角形．</p>https://111qqz.com/en/post/acm-icpc/2015/2015-07-31-hdoj2436/Fri, 31 Jul 2015 20:16:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-07-31-hdoj2436/<h1 class="relative group">Collision Detection <div id="collision-detection" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#collision-detection" aria-label="Anchor">#</a> </span> </h1> <p>**Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1207    Accepted Submission(s): 367 **</p>https://111qqz.com/en/post/acm-icpc/2015/2015-07-22-hdu4082/Wed, 22 Jul 2015 08:53:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-07-22-hdu4082/<p><a href="http://acm.hust.edu.cn/vjudge/contest/view.action?cid=83295#problem/I" target="_blank" rel="noreferrer">http://acm.hust.edu.cn/vjudge/contest/view.action?cid=83295#problem/I</a></p> <p>最多18个点，选3个点，能够成的三角形不超过1000个，O(n2)暴力就可以。</p>https://111qqz.com/en/post/acm-icpc/2015/2015-07-21-poj2398/Tue, 21 Jul 2015 13:13:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-07-21-poj2398/<p><a href="http://poj.org/problem?id=2398" target="_blank" rel="noreferrer">http://poj.org/problem?id=2398</a></p> <p>题意大概是说将一个盒子用n个board分成n+1 部分</p> <p>然后往里面放toy,给定盒子,board,和toy的坐标</p>https://111qqz.com/en/post/acm-icpc/2015/2015-02-19-hdu5120/Thu, 19 Feb 2015 07:22:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-02-19-hdu5120/<p>题意：求两个相等的圆环的相交的面积&hellip;. 简单计算几何+容斥原理？ 扇形面积公式记错调了半天2333333333      这题不难&hellip;倒是从学长那里收获了几点关于代码规范的问题&hellip;  听说了学长在北京区域赛时把PI定义错了一位结果一直WA的教训&hellip;. 以后还是写acos(-1)吧 局部变量和全局变量因为【想怎么其变量名想得整个人都不好了】就起成了一样的&hellip;被学长给了差评。 哦，对！还有一个就是发现了cmath库里有一个奇葩的函数名叫y1.。。。。。。。 —————————————————————————————————————————————— 竟然CE了  提示 error:pow(int,int) is ambiguous 看来我对语言的掌握程度还是不行呀&hellip;..</p>