https://111qqz.com/en/tags/floyd/Recent content in Floyd on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzSun, 21 Aug 2016 11:18:49 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-21-hdu-5036/Sun, 21 Aug 2016 11:18:49 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-08-21-hdu-5036/<p><a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5036" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：有n扇门，n种钥匙，一一对应。每扇门打开后可能得到k把钥匙（k可能为0）。一扇门还可以用一颗炸弹炸开。现在问要开所有门，使用炸弹的期望个数。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-06-02-hdu-2448/Thu, 02 Jun 2016 22:15:14 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-06-02-hdu-2448/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=2448" target="_blank" rel="noreferrer">hdu2448 题目链接</a></p> <p>题意：n个船n个港口，一个港口只能承接一个船，m个油田，给出n个船各自在哪个油田，然后给出m个油田之间的无相图，然后给出油田和港口之间的有向图。求n个船到达港口的最小距离之和。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-05-26-poj-2594/Thu, 26 May 2016 12:43:12 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-05-26-poj-2594/<p><a href="http://poj.org/problem?id=2594" target="_blank" rel="noreferrer">poj 2594 题目链接</a></p> <p>题意：一个DAG图，每个点有宝藏&hellip;可以降落任意个机器人到任意点&hellip;然后机器人可以沿着路径走，路过某个点的时候，可以取走该点的宝藏。问要取走所有宝藏，最少需要多少个机器人。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-05-24-poj-1932/Tue, 24 May 2016 13:00:45 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-05-24-poj-1932/<p><a href="http://poj.org/problem?id=1932" target="_blank" rel="noreferrer">poj1932题目链接</a></p> <p>题意：初始在点1，有100点能量，然后每个点有一个能量值【-100,100】，经过某个点会加上这个点的能量值，问能否找到一条到点n且的路线，且路径任何点的能量值一直为正。一共不超过100个点。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-04-09-bzoj-1641-usaco2007-novcow-hurdles-e5a5b6e7899be8b7a8e6a08f-floyd/Sat, 09 Apr 2016 17:41:46 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-04-09-bzoj-1641-usaco2007-novcow-hurdles-e5a5b6e7899be8b7a8e6a08f-floyd/<h2 class="relative group">1641: [Usaco2007 Nov]Cow Hurdles 奶牛跨栏 <div id="1641-usaco2007-novcow-hurdles-奶牛跨栏" 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="#1641-usaco2007-novcow-hurdles-%e5%a5%b6%e7%89%9b%e8%b7%a8%e6%a0%8f" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 5 Sec  Memory Limit: 64 MB Submit: 531  Solved: 344 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1641" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1641" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1641" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-04-03-bzoj1624/Sun, 03 Apr 2016 19:07:17 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-04-03-bzoj1624/<h2 class="relative group">1624: [Usaco2008 Open] Clear And Present Danger 寻宝之路 <div id="1624-usaco2008-open-clear-and-present-danger-寻宝之路" 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="#1624-usaco2008-open-clear-and-present-danger-%e5%af%bb%e5%ae%9d%e4%b9%8b%e8%b7%af" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 5 Sec  Memory Limit: 64 MB Submit: 507  Solved: 345 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1624" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1624" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1624" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-04-02-bzoj1612/Sat, 02 Apr 2016 07:55:10 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-04-02-bzoj1612/<h2 class="relative group">1612: [Usaco2008 Jan]Cow Contest奶牛的比赛 <div id="1612-usaco2008-jancow-contest奶牛的比赛" 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="#1612-usaco2008-jancow-contest%e5%a5%b6%e7%89%9b%e7%9a%84%e6%af%94%e8%b5%9b" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 5 Sec  Memory Limit: 64 MB Submit: 900  Solved: 597 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1612" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1612" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1612" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-03-31-bc-74-div1-1001-hdu-5636-shortest-path-floydefbc9f/Thu, 31 Mar 2016 10:10:34 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-03-31-bc-74-div1-1001-hdu-5636-shortest-path-floydefbc9f/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=5636" target="_blank" rel="noreferrer">题目链接</a> 题意：有一条n个节点的链，节点i和节点j的距离为abs(i-j) 现在新增加三条边，距离也都为1，然后给出m个询问，每组询问给出两个点s,t，问s,t之间的最短距离。 思路：比赛的时候没搞出来。 观察特点，对于大多数点来说，都是没有直接的改变，只是增加了三条边。总的思路是：之前s到t的距离为abs(s-t),通过枚举中间经过的特殊点，观察是否能使得距离减小。</p>https://111qqz.com/en/post/acm-icpc/2015/2015-12-17-poj3660/Thu, 17 Dec 2015 14:22:58 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-12-17-poj3660/<p><a href="http://poj.org/problem?id=3660" target="_blank" rel="noreferrer">http://poj.org/problem?id=3660</a> 题意：给定n个奶牛，m个奶牛的关系，a,b表示a比b强&hellip;问能确定多少个奶牛的排名。 思路：最重要的一点是。。能确定奶牛i的排名的条件是。。知道奶牛i和其他n-1个奶牛的关系。。不管是能打败奶牛i也好。。会被奶牛i打败也好。。只要不是不确定就行。。所以我们跑一遍floyd做传递闭包。得到任何两个点之间的联系。然后对于每一个点。看其他n-1个点是否和他有关系。</p>https://111qqz.com/en/post/acm-icpc/2015/2015-12-05-cf500b/Sat, 05 Dec 2015 07:35:09 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-12-05-cf500b/<p><a href="http://codeforces.com/contest/500/problem/B" target="_blank" rel="noreferrer">http://codeforces.com/contest/500/problem/B</a></p> <p>题意：给定一个1至n的数的一种排列。给定一个n*n的矩阵，a[i][j]==0代表pi,pj不可以交换，a[i][j]为1代表p[i],p[j]可以交换。 问字典序最小的排列。。</p>