https://111qqz.com/en/tags/%E4%B9%B1%E6%90%9E/Recent content in 乱搞 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzMon, 25 Sep 2017 10:55:57 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-09-25-codeforces-edu-29e/Mon, 25 Sep 2017 10:55:57 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-09-25-codeforces-edu-29e/<p><a href="http://codeforces.com/contest/863/problem/E" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：有若干线段，给出起点和终点，问是否有一个线段是冗余的。冗余的意思是说，对于该线段所覆盖的所有整数点，没有该线段，也能被其他一个或者多个线段覆盖到。如果有，输出任意<strong>一个</strong>冗余线段即可。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-01-30-bzoj-1303-cqoi2009e4b8ade4bd8de695b0e59bbeefbc88e5898de7bc80e5908ee7bc80e5928ce4b9b1e6909eefbc89/Mon, 30 Jan 2017 16:09:22 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-01-30-bzoj-1303-cqoi2009e4b8ade4bd8de695b0e59bbeefbc88e5898de7bc80e5908ee7bc80e5928ce4b9b1e6909eefbc89/<h2 class="relative group">1303: [CQOI2009]中位数图 <div id="1303-cqoi2009中位数图" 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="#1303-cqoi2009%e4%b8%ad%e4%bd%8d%e6%95%b0%e5%9b%be" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 1 Sec  Memory Limit: 162 MB Submit: 2480  Solved: 1529 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1303" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1303" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1303" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-04-08-bzoj-1637/Fri, 08 Apr 2016 06:59:57 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-04-08-bzoj-1637/<h2 class="relative group">1637: [Usaco2007 Mar]Balanced Lineup <div id="1637-usaco2007-marbalanced-lineup" 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="#1637-usaco2007-marbalanced-lineup" aria-label="Anchor">#</a> </span> </h2> <p>Time Limit: 5 Sec  Memory Limit: 64 MB Submit: 503  Solved: 336 [<a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1637" target="_blank" rel="noreferrer">Submit</a>][<a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1637" target="_blank" rel="noreferrer">Status</a>][<a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1637" target="_blank" rel="noreferrer">Discuss</a>]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-03-31-codeforces-346-div-2-c-tanya-and-toys-e69ab4e58a9be4b9b1e6909e/Thu, 31 Mar 2016 08:36:59 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-03-31-codeforces-346-div-2-c-tanya-and-toys-e69ab4e58a9be4b9b1e6909e/<p><a href="http://codeforces.com/contest/659/problem/C" target="_blank" rel="noreferrer">题目链接</a> 题意:有1E9个礼物，第i个礼物价钱是i,然后现在已经有n个不重复的礼物，a[i],m元钱，想尽可能多得买不同种类的礼物，还能买多少个。 思路：先不考虑已经买的，从1连续买到k,然后考虑子啊这个区间内已经买的，等于实际上没有花钱。 反正就是暴力搞啊搞啊。。我也不知道怎么搞。。 结果最后。。方案数为0的时候。。。最后一个答案我是单独输出的。。忘了判断了。。。所以会输出两个0.宝宝心里苦啊。。。。。。。。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-03-31-484b/Thu, 31 Mar 2016 07:20:25 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-03-31-484b/<p><a href="http://codeforces.com/problemset/problem/484/B" target="_blank" rel="noreferrer">题目链接</a> 题意：给出n个元素的序列，求出最大的a[i]%a[j] (i&gt;=j) 思路：没思路。。。。</p>https://111qqz.com/en/post/acm-icpc/2015/2015-09-30-codeforces322div2c-developingskillse6809de8b7af/Wed, 30 Sep 2015 02:38:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-09-30-codeforces322div2c-developingskillse6809de8b7af/<p>time limit per test</p> <p>1 second</p> <p>memory limit per test</p> <p>256 megabytes</p> <p>input</p> <p>standard input</p> <p>output</p> <p>standard output</p> <p>Petya loves computer games. Finally a game that he&rsquo;s been waiting for so long came out!</p>