<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Orz_yy的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Orz_yy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Orz_yy]]></copyright><item><title><![CDATA[cf rating 1600]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/163586920</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/163586920</guid><author>Orz_yy</author><pubDate>Sat, 08 Aug 2026 15:43:56 +0800</pubDate><description><![CDATA[最小值为min(st.size(),st.size()-cnt/2+1);记最大的非法对的字符是x，总非法对数为k，x的对数为cntx。(k为奇数时，最后一次交换只能少1，所以答案为k/2上取整)发现k/2次交换，每次均可以让非法对的个数少2。当i为0时，会访问f[-1][0]，特判掉。若n为奇数或某个数字出现的次数>n/2。并给每个数的度数打上标记。统计有多少个度为1的点。先统计出所有的非法对。若cntx<=k/2。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 1112 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/163410074</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/163410074</guid><author>Orz_yy</author><pubDate>Sun, 02 Aug 2026 11:23:18 +0800</pubDate><description><![CDATA[所以Alice和Bob的最优策略都是删掉最前面的0和1。关闭输入输出流后，不要用putchar函数。如果a数组的数字都变成b数组的数字后还。01表示a[i]=0,b[i]=1;10表示a[i]=1,b[i]=0;Alice删0使字典序最大。如果cnt01<cnt10。最后剩下的位数是相同的，同理cnt01<=m/2。Bob删1使字典序最小。]]></description><category></category></item><item><title><![CDATA[cf rating 1600]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/163395684</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/163395684</guid><author>Orz_yy</author><pubDate>Sat, 01 Aug 2026 21:27:09 +0800</pubDate><description><![CDATA[【代码】cf rating 1600。]]></description><category></category></item><item><title><![CDATA[cf ratring1600 7月29日]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/163393429</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/163393429</guid><author>Orz_yy</author><pubDate>Sat, 01 Aug 2026 14:41:58 +0800</pubDate><description><![CDATA[【代码】cf ratring1600 7月29日。]]></description><category></category></item><item><title><![CDATA[cf rating 1600 7月28日]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/163282149</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/163282149</guid><author>Orz_yy</author><pubDate>Wed, 29 Jul 2026 09:30:09 +0800</pubDate><description><![CDATA[如果存在区间的和大于0，让每一个区间的和都大于0。]]></description><category></category></item><item><title><![CDATA[7.26 cf rating1600 3道]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/163213090</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/163213090</guid><author>Orz_yy</author><pubDate>Sun, 26 Jul 2026 17:49:51 +0800</pubDate><description><![CDATA[本文摘要了3道Codeforces题目解法： C. Hossam and Trainees - 使用欧拉筛预处理质数，通过分解每个数的质因数并检查重复来判断是否存在两个数有共同质因数。时间复杂度O(n)。 D. Same Count One - 统计每行1的个数和总数，若无法均分则无解。否则通过交换操作使每行1的个数相等，记录交换步骤并输出。 C. Interesting Sequence - 利用lowbit操作判断是否存在解，通过不断加lowbit(a)来寻找满足条件的数，若无法达到目标则输出-1。 ]]></description><category></category></item><item><title><![CDATA[Codeforces Rating1500 刷题]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/162897251</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/162897251</guid><author>Orz_yy</author><pubDate>Wed, 15 Jul 2026 20:53:27 +0800</pubDate><description><![CDATA[cf 1500]]></description><category></category></item><item><title><![CDATA[Codeforces Round 1105 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/162839583</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/162839583</guid><author>Orz_yy</author><pubDate>Mon, 13 Jul 2026 17:20:39 +0800</pubDate><description><![CDATA[Codeforces Round 1105 (Div. 2)]]></description><category></category></item><item><title><![CDATA[Codeforces Round 1102 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/162818217</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/162818217</guid><author>Orz_yy</author><pubDate>Sun, 12 Jul 2026 21:22:36 +0800</pubDate><description><![CDATA[Codeforces Round 1102 (Div. 2)ABC]]></description><category></category></item><item><title><![CDATA[Codeforces Round 1093 (Div. 2) ABC]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/162792949</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/162792949</guid><author>Orz_yy</author><pubDate>Sat, 11 Jul 2026 17:46:57 +0800</pubDate><description><![CDATA[Codeforces Round 1093 (Div. 2)ABC]]></description><category></category></item><item><title><![CDATA[Codeforces 复健(Rehabilitation)]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/159043148</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/159043148</guid><author>Orz_yy</author><pubDate>Sat, 14 Mar 2026 09:57:11 +0800</pubDate><description><![CDATA[菜菜地 复健下]]></description><category></category></item><item><title><![CDATA[图的基本应用（洛谷题单）]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/158771170</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/158771170</guid><author>Orz_yy</author><pubDate>Sat, 07 Mar 2026 12:35:41 +0800</pubDate><description><![CDATA[图的基本应用（洛谷题单）]]></description><category></category></item><item><title><![CDATA[2026牛客寒假算法基础集训营2（7/10）]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/158416593</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/158416593</guid><author>Orz_yy</author><pubDate>Thu, 26 Feb 2026 03:14:49 +0800</pubDate><description><![CDATA[2026牛客寒假算法基础集训营2]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 186 Editorial]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/158267029</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/158267029</guid><author>Orz_yy</author><pubDate>Sat, 21 Feb 2026 22:07:39 +0800</pubDate><description><![CDATA[Educational Codeforces Round 186 Editorial]]></description><category></category></item><item><title><![CDATA[牛客周赛 Round 130]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/158125917</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/158125917</guid><author>Orz_yy</author><pubDate>Mon, 16 Feb 2026 11:28:04 +0800</pubDate><description><![CDATA[牛客周赛 Round 130]]></description><category></category></item><item><title><![CDATA[硬件连接：技术与美学的完美融合]]></title><link>https://blog.youkuaiyun.com/Orz_yy/article/details/155321770</link><guid>https://blog.youkuaiyun.com/Orz_yy/article/details/155321770</guid><author>Orz_yy</author><pubDate>Thu, 27 Nov 2025 19:16:26 +0800</pubDate><description><![CDATA[硬件连接是技术与艺术的融合鼓励读者在实践中探索个性化方案。]]></description><category></category></item></channel></rss>